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 listJan 1, 2026 18:08zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:42Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:42011,411,3481,045,0002,232,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 14:42011,077,5431,551,0001,551,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 14:42010,966,1121,549,0001,549,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 18:084,369165,851,143142,175,0002,002,0002,420,736
5Jan 1, 2026 18:084,388171,365,605142,799,0001,997,0002,273,280
6Jan 1, 2026 18:084,435171,789,331144,362,0002,005,0002,535,424