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 listDec 22, 2025 22:35zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:34Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:34011,060,5551,661,0001,660,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 14:34010,978,5631,606,0001,606,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 14:34010,921,8961,586,0001,586,0002,121,728expected "16384 ", got "32 "stderr
4Dec 22, 2025 22:354,243163,682,554131,012,0009,000,0002,490,368
5Dec 22, 2025 22:354,284166,611,638133,349,0008,021,0002,318,336
6Dec 22, 2025 22:354,293166,989,496132,690,0008,979,0002,441,216