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 25, 2026 08:51Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 08:510883,749,634872,222,0001,053,00024,576Exit with code 3: in mode=100600 size=300290682 fl=8000 | out mode=100600 fl=8002 | aff=1,2,3, onln=3 | | 3thr wall=0.3351 cpu=0.3349 1thr=0.1114 | lines=30000000 last=10 len:0,2,170,2066,2308,2308,2308,2326,2318,2313,2302,2317,2312,2316,2309,2315,...stderr