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 listJul 22, 2026 21:26boop34boop34Score: 15,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 21:2715,060506,971,339490,188,0006,819,0002,113,536
2Jul 22, 2026 21:2715,064506,966,900490,285,0006,841,0002,113,536
3Jul 22, 2026 21:2715,088508,141,431491,130,0006,777,0002,113,536
4Jul 22, 2026 21:2715,136509,328,073492,632,0006,865,0002,113,536
5Jul 22, 2026 21:2715,136509,351,176492,650,0006,853,0002,113,536
6Jul 22, 2026 21:2715,149509,749,943493,185,0006,757,0002,113,536
7Jul 22, 2026 21:2715,515521,855,687505,360,0006,637,0002,113,536
8Jul 22, 2026 21:2715,553523,076,880506,609,0006,654,0002,113,536
9Jul 22, 2026 21:2715,557523,230,220506,753,0006,638,0002,113,536