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 00:07Victor MerckléVictor MerckléScore: 6,647Success
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 00:086,630227,491,117180,237,00038,562,0002,113,536
2May 12, 2026 00:086,631229,400,822180,253,00038,577,0002,113,536
3May 12, 2026 00:086,635226,712,586180,202,00038,754,0002,113,536
4May 12, 2026 00:086,638227,065,048180,423,00038,643,0002,113,536
5May 12, 2026 00:086,647228,574,616180,909,00038,468,0002,113,536
6May 12, 2026 00:086,669227,549,988181,627,00038,475,0002,113,536
7May 12, 2026 00:086,681230,852,854181,870,00038,632,0002,113,536
8May 12, 2026 00:086,683231,279,171181,869,00038,685,0002,113,536
9May 12, 2026 00:086,727231,402,536184,409,00037,600,0002,113,536