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 27, 2026 19:51Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 12:23Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 12:28020,007,346,64919,994,928,0003,043,00016,384Killed by timeout
2Jun 27, 2026 19:523,428121,046,168112,055,0001,095,0002,113,536
3Jun 27, 2026 19:523,430121,197,185112,186,0001,025,0002,113,536
4Jun 27, 2026 19:523,431121,251,937112,136,0001,089,0002,113,536
5Jun 27, 2026 19:523,434121,382,002112,240,0001,101,0002,113,536
6Jun 27, 2026 19:523,434121,328,055112,242,0001,102,0002,113,536
7Jun 27, 2026 19:523,436121,537,911112,348,0001,066,0002,113,536
8Jun 27, 2026 19:523,441121,519,409112,461,0001,106,0002,113,536
9Jun 27, 2026 19:523,442121,850,308112,484,0001,108,0002,113,536
10Jun 27, 2026 19:523,461122,255,433113,179,0001,040,0002,113,536