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 20, 2026 14:01olliecrowolliecrowError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 14:0102,290,983,0922,229,987,00038,947,0002,756,608expected "1026239 ", got "11639212272108695165 "stderr
2Apr 20, 2026 14:0102,278,722,8152,226,048,00029,000,0002,564,096expected "1018732 ", got "17546718819366622952 "stderr
3Apr 20, 2026 14:0102,292,743,3082,228,182,00040,948,0002,838,528expected "1026130 ", got "15703744622219749536 "stderr