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 3, 2026 03:57Rajarshi BasuRajarshi BasuScore: 3,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 03:573,325135,582,521107,738,0001,995,0002,506,752
2Jan 3, 2026 03:573,340134,213,420107,218,0003,006,0002,383,872
3Jan 3, 2026 03:573,360136,403,580108,888,0001,997,0002,285,568
4Jan 3, 2026 03:573,378136,855,667108,458,0003,012,0002,285,568
5Jan 3, 2026 03:573,400137,025,053110,194,0002,003,0002,383,872
6Jan 3, 2026 03:573,413134,080,752108,655,0003,987,0002,281,472
7Jan 3, 2026 03:573,421134,568,193110,893,0001,998,0002,285,568
8Jan 3, 2026 03:573,422143,326,756109,939,0002,998,0002,392,064
9Jan 3, 2026 03:573,449136,528,593110,823,0002,995,0002,285,568