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 listMay 13, 2026 13:59Josu San MartinJosu San MartinScore: 3,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 14:003,446123,342,723112,688,0001,048,0002,113,536
2May 13, 2026 14:003,452123,262,182112,864,0001,058,0002,113,536
3May 13, 2026 14:003,454124,260,227112,954,0001,046,0002,113,536
4May 13, 2026 14:003,455124,681,186112,975,0001,051,0002,113,536
5May 13, 2026 14:003,455125,586,182112,964,0001,053,0002,113,536
6May 13, 2026 14:003,461124,022,513113,183,0001,057,0002,113,536
7May 13, 2026 14:003,462123,480,097113,223,0001,051,0002,113,536
8May 13, 2026 14:003,466125,047,649113,323,0001,055,0002,113,536
9May 13, 2026 14:003,468123,517,892113,403,0001,049,0002,113,536