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 listJan 8, 2026 04:14Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 08:39Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 08:390584,844,447436,214,000134,072,0002,117,632expected "2919949 ", got "2316699 "
2Sep 9, 2026 08:390542,333,032398,182,000133,998,0002,117,632expected "2919925 ", got "2316690 "
3Sep 9, 2026 08:390537,853,454397,117,000130,552,0002,117,632expected "2919943 ", got "2316686 "
4Jan 8, 2026 04:1415,034522,912,334362,356,000133,762,0002,310,144
5Jan 8, 2026 04:1415,179537,619,932363,935,000136,975,0002,502,656
6Jan 8, 2026 04:1416,202558,018,433395,749,000138,911,0002,322,432