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:42Victor MerckléVictor MerckléScore: 7,113Success
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:437,050241,101,792195,033,00037,622,0002,113,536
2May 12, 2026 01:437,082241,327,627195,994,00037,744,0002,113,536
3May 12, 2026 01:437,096242,832,960195,548,00038,639,0002,113,536
4May 12, 2026 01:437,101241,681,441195,748,00038,615,0002,113,536
5May 12, 2026 01:437,113242,131,224197,072,00037,672,0002,113,536
6May 12, 2026 01:437,115242,304,680196,147,00038,663,0002,113,536
7May 12, 2026 01:437,131243,029,752197,697,00037,650,0002,113,536
8May 12, 2026 01:437,148245,098,243198,200,00037,702,0002,113,536
9May 12, 2026 01:437,151245,743,089197,240,00038,747,0002,113,536