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 08:19Josu San MartinJosu San MartinScore: 3,468Success
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 08:203,463123,045,629113,123,0001,171,0002,113,536
2May 13, 2026 08:203,466123,844,818113,200,0001,183,0002,113,536
3May 13, 2026 08:203,466124,826,304113,219,0001,165,0002,113,536
4May 13, 2026 08:203,467123,313,916113,277,0001,155,0002,113,536
5May 13, 2026 08:203,468124,034,420113,280,0001,178,0002,113,536
6May 13, 2026 08:203,495125,516,498114,175,0001,165,0002,113,536
7May 13, 2026 08:203,499127,123,363114,303,0001,184,0002,113,536
8May 13, 2026 08:203,501126,337,298114,383,0001,163,0002,113,536
9May 13, 2026 08:203,503124,920,675114,589,0001,012,0002,113,536