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 27, 2026 03:39Victor MerckléVictor MerckléScore: 4,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 03:394,791165,963,806121,396,00036,709,0002,113,536
2Jun 27, 2026 03:394,791165,693,885121,276,00036,849,0002,113,536
3Jun 27, 2026 03:394,802166,598,664121,733,00036,745,0002,113,536
4Jun 27, 2026 03:394,802167,547,916121,845,00036,651,0002,113,536
5Jun 27, 2026 03:394,803166,328,864121,612,00036,891,0002,113,536
6Jun 27, 2026 03:394,805166,500,663121,580,00037,007,0002,113,536
7Jun 27, 2026 03:394,828167,505,789122,396,00036,948,0002,113,536
8Jun 27, 2026 03:394,831167,645,490122,547,00036,908,0002,113,536
9Jun 27, 2026 03:394,831167,454,107121,820,00037,629,0002,113,536