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:10Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 13:57M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:3102,904,330,9712,887,141,0004,003,0002,142,208expected "1000000 ", got "1 "stderr
2May 17, 2026 14:3102,834,573,1662,821,068,0004,002,0002,142,208expected "1000000 ", got "1 "stderr
3May 17, 2026 14:3102,905,322,4782,891,110,0005,002,0002,142,208expected "1000000 ", got "1 "stderr
4Dec 6, 2024 21:104,271128,128,167198,888,0004,017,0002,813,952
5Dec 6, 2024 21:104,492134,747,808213,130,0005,975,0002,592,768
6Dec 6, 2024 21:104,774143,231,115217,413,0005,983,0002,363,392