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 listDec 6, 2024 21:09Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:58M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:5802,601,258,1082,585,416,0007,016,0002,142,208expected "1000000 ", got "1 "stderr
2May 17, 2026 07:5802,920,342,7632,905,369,0004,002,0002,142,208expected "1000000 ", got "1 "stderr
3May 17, 2026 07:5802,650,114,0862,635,404,0004,003,0002,142,208expected "1000000 ", got "1 "stderr
4Dec 6, 2024 21:094,260127,811,839200,980,0004,999,0002,711,552
5Dec 6, 2024 21:094,490134,696,628206,906,0004,997,0002,588,672
6Dec 6, 2024 21:094,611138,316,631221,148,0003,002,0002,363,392