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 listApr 18, 2026 16:06olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 18:39Andrew Epstein26.90CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 18:510775,445,874757,395,0008,675,0002,134,016expected "2107764 ", got "2075145 "
2Oct 15, 2026 18:510771,524,476753,190,0008,912,0002,134,016expected "2107452 ", got "2074833 "
3Oct 15, 2026 18:5160018,017,97909,311,0002,138,112
4Apr 18, 2026 16:0612,637379,123,4661,010,550,00010,005,0002,375,680
5Apr 18, 2026 16:0612,673380,178,6821,017,015,00010,000,0002,633,728
6Apr 18, 2026 16:0613,134394,012,9911,053,540,0008,996,0002,609,152