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 listMay 12, 2026 01:30Victor MerckléVictor MerckléScore: 6,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:316,739231,060,389184,827,00037,569,0002,113,536
2May 12, 2026 01:316,746233,397,870184,175,00038,443,0002,113,536
3May 12, 2026 01:316,758231,855,252184,508,00038,518,0002,113,536
4May 12, 2026 01:316,760230,525,748185,369,00037,723,0002,113,536
5May 12, 2026 01:316,763233,518,199184,713,00038,495,0002,113,536
6May 12, 2026 01:316,777232,084,773184,973,00038,692,0002,113,536
7May 12, 2026 01:316,779231,775,462185,086,00038,639,0002,113,536
8May 12, 2026 01:316,788233,301,006185,435,00038,582,0002,113,536
9May 12, 2026 01:316,877236,115,526189,199,00037,774,0002,113,536