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 listAug 17, 2026 23:24Josu San MartinJosu San MartinScore: 3,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 23:303,497123,740,597114,392,0001,009,0002,113,536
2Aug 17, 2026 23:303,515124,201,135114,723,0001,290,0002,113,536
3Aug 17, 2026 23:303,519124,192,643114,861,0001,288,0002,113,536
4Aug 17, 2026 23:303,521124,231,282115,200,0001,008,0002,113,536
5Aug 17, 2026 23:303,528124,611,956115,138,0001,293,0002,113,536
6Aug 17, 2026 23:303,567125,949,240116,454,0001,276,0002,113,536
7Aug 17, 2026 23:304,037150,102,247132,166,0001,065,0002,113,536
8Aug 17, 2026 23:304,174151,015,118136,716,0001,048,0002,113,536
9Aug 17, 2026 23:304,803173,763,137157,462,0001,062,0002,113,536