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 listJun 28, 2026 03:12Victor MerckléVictor MerckléScore: 3,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 03:133,352119,767,585109,505,0001,130,0002,113,536
2Jun 28, 2026 03:133,352118,443,122109,560,0001,080,0002,113,536
3Jun 28, 2026 03:133,360118,590,925109,755,0001,141,0002,113,536
4Jun 28, 2026 03:133,362118,658,216109,818,0001,132,0002,113,536
5Jun 28, 2026 03:133,366118,905,353110,006,0001,092,0002,113,536
6Jun 28, 2026 03:133,369118,941,265109,884,0001,293,0002,113,536
7Jun 28, 2026 03:133,375118,944,035110,227,0001,157,0002,113,536
8Jun 28, 2026 03:133,389119,784,375110,687,0001,154,0002,113,536
9Jun 28, 2026 03:133,400119,998,447111,094,0001,138,0002,113,536