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 22, 2026 23:44Victor MerckléVictor MerckléScore: 4,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 23:454,977171,806,788127,475,00036,777,0002,113,536
2Jun 22, 2026 23:454,988172,234,023127,838,00036,776,0002,113,536
3Jun 22, 2026 23:454,990172,235,271127,917,00036,766,0002,113,536
4Jun 22, 2026 23:454,992172,319,810127,918,00036,823,0002,113,536
5Jun 22, 2026 23:454,992172,288,845127,121,00037,641,0002,113,536
6Jun 22, 2026 23:454,993172,902,615127,900,00036,896,0002,113,536
7Jun 22, 2026 23:455,005172,842,431128,370,00036,824,0002,113,536
8Jun 22, 2026 23:455,017173,163,091127,811,00037,758,0002,113,536
9Jun 22, 2026 23:455,034173,959,237128,215,00037,937,0002,113,536