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:16Victor MerckléVictor MerckléScore: 6,672Success
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:176,630227,530,475180,215,00038,606,0002,113,536
2May 12, 2026 01:176,631228,279,587180,300,00038,537,0002,113,536
3May 12, 2026 01:176,633229,357,258180,266,00038,628,0002,113,536
4May 12, 2026 01:176,672227,750,397181,682,00038,498,0002,113,536
5May 12, 2026 01:176,672229,289,019181,530,00038,660,0002,113,536
6May 12, 2026 01:176,674227,539,212181,563,00038,690,0002,113,536
7May 12, 2026 01:176,677228,321,158182,584,00037,771,0002,113,536
8May 12, 2026 01:176,682229,211,835181,738,00038,778,0002,113,536
9May 12, 2026 01:176,711229,629,870184,044,00037,426,0002,113,536