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 20:07Josu San MartinJosu San MartinScore: 9,385Success
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 20:079,288328,202,658302,503,0003,993,0002,273,280
2Jan 8, 2026 20:109,316333,321,184303,436,0003,992,0002,314,240
3Jan 8, 2026 20:109,371338,077,267304,254,0004,987,0002,502,656
4Jan 8, 2026 20:109,385339,311,650305,696,0003,996,0002,498,560
5Jan 8, 2026 20:079,413337,476,294306,644,0003,995,0002,383,872
6Jan 8, 2026 20:079,443340,155,592307,609,0003,994,0002,322,432