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 19:39Pavel SkripkinPavel SkripkinScore: 15,738Success
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 19:4015,503519,094,924508,577,0003,024,0002,117,632
2May 13, 2026 19:4015,637523,401,689512,895,0003,128,0002,117,632
3May 13, 2026 19:4015,677526,995,984514,257,0003,103,0002,117,632
4May 13, 2026 19:4015,715527,256,255515,429,0003,176,0002,117,632
5May 13, 2026 19:4015,738526,893,145516,289,0003,068,0002,117,632
6May 13, 2026 19:4016,425551,073,943538,861,0003,178,0002,117,632
7May 13, 2026 19:4016,672559,113,183547,073,0003,122,0002,117,632
8May 13, 2026 19:4016,692560,440,523547,627,0003,234,0002,117,632
9May 13, 2026 19:4018,547623,642,216608,614,0003,465,0002,117,632