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 04:44Josu San MartinJosu San MartinScore: 16,340Success
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 04:4415,296527,496,629370,818,000133,934,0002,273,280
2Jan 8, 2026 04:4415,328534,089,162367,864,000137,949,0002,297,856
3Jan 8, 2026 04:4415,453537,030,168374,956,000134,984,0002,351,104
4Jan 8, 2026 04:4416,257564,891,093399,623,000136,871,0002,408,448
5Jan 8, 2026 04:4416,340569,157,735403,409,000135,801,0002,510,848
6Jan 8, 2026 04:4416,421574,083,961401,909,000139,968,0002,297,856
7Jan 8, 2026 04:4416,852591,077,468413,334,000142,770,0002,400,256
8Jan 8, 2026 04:4417,186594,891,814429,349,000137,791,0002,514,944
9Jan 8, 2026 04:4417,392603,012,519431,964,000141,988,0002,342,912