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 listJul 23, 2026 14:41boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 14:430495,662,853477,429,0008,484,0002,113,536expected "1021721 ", got "15 "
2Jul 23, 2026 14:430495,703,443477,330,0008,566,0002,113,536expected "1018619 ", got "15 "
3Jul 23, 2026 14:430496,500,009477,262,0009,453,0002,113,536expected "1026920 ", got "15 "