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:40Victor MerckléVictor MerckléScore: 6,852Success
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:416,829234,495,862187,767,00037,620,0002,113,536
2May 12, 2026 01:416,831234,237,399186,998,00038,431,0002,113,536
3May 12, 2026 01:416,841234,623,267187,994,00037,767,0002,113,536
4May 12, 2026 01:416,851233,415,684188,438,00037,656,0002,113,536
5May 12, 2026 01:416,852234,225,165187,386,00038,750,0002,113,536
6May 12, 2026 01:416,859236,131,867187,838,00038,534,0002,113,536
7May 12, 2026 01:416,883237,433,924188,491,00038,663,0002,113,536
8May 12, 2026 01:416,886235,652,688189,715,00037,541,0002,113,536
9May 12, 2026 01:416,900236,378,516189,102,00038,615,0002,113,536