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 listOct 17, 2026 04:21e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 04:2103,703,517,5053,691,376,0001,003,0002,113,536expected "1020507 ", got "902049 "
2Oct 17, 2026 04:2103,704,831,5763,692,495,0001,033,0002,113,536expected "1026338 ", got "905448 "
3Oct 17, 2026 04:2103,714,125,6773,702,210,0001,005,0002,113,536expected "1020228 ", got "901814 "