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 8, 2026 04:41Josu San MartinJosu San MartinScore: 12,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 04:4112,653443,190,478414,569,0002,996,0002,453,504
2Jan 8, 2026 04:4112,722447,029,871416,817,0002,998,0002,367,488
3Jan 8, 2026 04:4112,738452,185,703417,370,0002,995,0002,289,664
4Jan 8, 2026 04:4112,766455,391,771419,269,0002,001,0002,355,200
5Jan 8, 2026 04:4112,772446,881,809418,472,0002,996,0002,342,912
6Jan 8, 2026 04:4112,824450,157,723421,189,0002,000,0002,289,664
7Jan 8, 2026 04:4112,825450,192,161420,214,0003,001,0002,342,912
8Jan 8, 2026 04:4112,831452,391,213420,424,0002,995,0002,355,200
9Jan 8, 2026 04:4112,908453,869,879423,971,0001,999,0002,347,008