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 9, 2026 02:44Josu San MartinJosu San MartinScore: 28,961Success
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 23:1928,384964,483,186928,698,0007,988,0002,392,064
2Jan 9, 2026 02:4428,707973,675,684937,334,0009,992,0002,334,720
3Jan 8, 2026 23:1928,748978,362,575941,682,0006,990,0002,289,664
4Jan 9, 2026 02:4428,961981,700,183949,721,0005,991,0002,330,624
5Jan 8, 2026 23:1929,018990,664,849949,611,0007,988,0002,363,392
6Jan 9, 2026 02:4429,349994,765,337961,529,0006,989,0002,347,008