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 listSep 12, 2026 05:21Haha ExpertHaha ExpertError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 05:2102,642,698,4932,555,597,00075,086,0002,146,304expected "1026394 ", got "2394452 "
2Sep 12, 2026 05:2102,645,282,1072,557,506,00074,353,0002,138,112expected "1019666 ", got "2388473 "
3Sep 12, 2026 05:2102,641,876,0742,555,502,00074,450,0002,146,304expected "1026156 ", got "2394055 "