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 06:46marko1597marko1597Score: 8,472Success
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 06:508,458253,765,155238,914,0006,457,0002,121,728stderr
2Aug 17, 2026 06:508,468254,066,155238,651,0006,217,0002,121,728stderr
3Aug 17, 2026 06:508,468254,065,486239,311,0006,225,0002,121,728stderr
4Aug 17, 2026 06:508,470254,124,136239,450,0006,462,0002,121,728stderr
5Aug 17, 2026 06:508,472254,162,105239,555,0006,244,0002,121,728stderr
6Aug 17, 2026 06:508,473254,219,948239,380,0006,443,0002,121,728stderr
7Aug 17, 2026 06:508,481254,457,477239,953,0006,238,0002,121,728stderr
8Aug 17, 2026 06:508,515255,458,530240,770,0006,463,0002,121,728stderr
9Aug 17, 2026 06:508,693260,815,049239,046,0006,255,0002,121,728stderr