Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listMay 13, 2026 15:38Pavel SkripkinPavel SkripkinScore: 13,984Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 15:3912,695427,815,670416,935,0002,010,0002,117,632
2May 13, 2026 15:3913,042439,760,569428,381,0002,008,0002,117,632
3May 13, 2026 15:3913,073441,549,494429,417,0002,006,0002,117,632
4May 13, 2026 15:3913,894468,784,507455,500,0003,009,0002,117,632
5May 13, 2026 15:3913,984470,678,491459,468,0002,009,0002,117,632
6May 13, 2026 15:3914,139474,037,789463,516,0003,072,0002,117,632
7May 13, 2026 15:3914,306479,569,072469,100,0003,026,0002,117,632
8May 13, 2026 15:3914,414482,945,730472,613,0003,051,0002,117,632
9May 13, 2026 15:3914,563487,993,660477,559,0003,023,0002,117,632