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 11, 2026 07:18Victor MerckléVictor MerckléScore: 14,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:1914,476488,650,415468,661,0009,074,0002,113,536
2May 11, 2026 07:1914,478486,595,515468,672,0009,112,0002,113,536
3May 11, 2026 07:1914,502487,265,840469,197,0009,383,0002,113,536
4May 11, 2026 07:1914,535489,907,877470,434,0009,252,0002,113,536
5May 11, 2026 07:1914,569491,512,936471,133,0009,676,0002,113,536
6May 11, 2026 07:1914,588492,850,141471,765,0009,640,0002,113,536
7May 11, 2026 07:1914,843501,531,237480,275,0009,572,0002,113,536
8May 11, 2026 07:1914,900500,505,319482,306,0009,415,0002,113,536
9May 11, 2026 07:1914,935501,640,336482,932,0009,927,0002,113,536