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 listJul 26, 2026 20:20Andrew TsibinAndrew TsibinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 18:15Andrew Epstein45.66CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 18:3401,365,365,7521,334,374,00019,335,0002,129,920expected "2104628 ", got "1858868 "
2Oct 15, 2026 18:3401,371,412,0961,341,246,00018,448,0002,129,920expected "2106414 ", got "1860654 "
3Oct 15, 2026 18:3438411,540,9731,268,00002,142,208
4Jul 26, 2026 20:2021,837655,120,517639,340,0005,235,0002,138,112
5Jul 26, 2026 20:2021,900657,004,696640,615,0005,188,0002,138,112
6Jul 26, 2026 20:2022,015660,478,115638,962,0005,065,0002,138,112