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 22, 2025 11:07Rajarshi BasuRajarshi BasuScore: 6,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 11:076,135184,043,182155,839,0003,995,0002,760,704
2Dec 22, 2025 11:076,176185,275,531156,211,0004,005,0002,768,896
3Dec 22, 2025 11:076,198185,931,744160,642,0002,008,0002,568,192
4Dec 22, 2025 11:076,220186,613,991157,458,0003,986,0002,760,704
5Dec 22, 2025 11:076,271188,127,973155,649,0003,991,0002,560,000
6Dec 22, 2025 11:076,279188,363,793157,076,0004,001,0002,760,704
7Dec 22, 2025 11:076,326189,782,258155,670,0004,989,0002,560,000
8Dec 22, 2025 11:076,351190,518,277159,455,0004,011,0002,551,808
9Dec 22, 2025 11:076,362190,868,604163,756,0002,995,0002,637,824