Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 12, 2026 00:58Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 08:54Tomislav Tunkovic12.41CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 09:03020,020,232,07039,800,853,000163,502,00057,344Killed by timeout
2Sep 9, 2026 09:0340612,208,23702,139,0002,158,592
3Jan 11, 2026 16:152,82884,848,053175,719,0002,008,0002,584,576
4Jan 11, 2026 16:152,96588,943,599175,615,0001,003,0002,572,288
5Jan 12, 2026 00:582,99089,692,949175,620,0002,007,0002,822,144
6Jan 12, 2026 00:583,01390,384,720176,522,0002,005,0002,875,392
7Jan 12, 2026 00:583,10693,182,591176,026,0002,011,0002,617,344
8Jan 11, 2026 16:153,409102,270,650174,948,0002,010,0002,490,368