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 listJun 21, 2026 03:50Victor MerckléVictor MerckléScore: 6,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 03:516,497222,267,417176,817,00037,607,0002,113,536
2Jun 21, 2026 03:516,504222,193,891176,260,00038,381,0002,113,536
3Jun 21, 2026 03:516,505222,131,487176,366,00038,317,0002,113,536
4Jun 21, 2026 03:516,510222,398,660176,510,00038,324,0002,113,536
5Jun 21, 2026 03:516,524222,815,383176,926,00038,375,0002,113,536
6Jun 21, 2026 03:516,539223,348,875177,259,00038,560,0002,113,536
7Jun 21, 2026 03:516,540223,662,891177,460,00038,383,0002,113,536
8Jun 21, 2026 03:516,551223,690,577177,680,00038,533,0002,113,536
9Jun 21, 2026 03:516,604225,509,743180,720,00037,234,0002,113,536