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 listAug 17, 2026 16:26Victor MerckléVictor MerckléScore: 3,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 16:393,545106,372,646288,267,0002,050,0002,150,400stderr
2Aug 17, 2026 16:393,545106,352,709288,191,0002,216,0002,150,400stderr
3Aug 17, 2026 16:393,552106,564,278286,610,0002,128,0002,154,496stderr
4Aug 17, 2026 16:393,556106,687,437285,736,0003,113,0002,154,496stderr
5Aug 17, 2026 16:393,558106,769,401287,048,0003,196,0002,154,496stderr
6Aug 17, 2026 16:393,564106,927,030288,789,0002,176,0002,154,496stderr
7Aug 17, 2026 16:393,566106,999,009289,807,0002,214,0002,150,400stderr
8Aug 17, 2026 16:393,569107,079,156287,707,0003,176,0002,154,496stderr
9Aug 17, 2026 16:394,208126,263,020310,328,0003,099,0002,150,400stderr