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 18, 2026 01:15Victor MerckléVictor MerckléScore: 1,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 01:201,90457,148,151140,873,0001,285,0002,170,880stderr
2Aug 18, 2026 01:201,91657,503,996141,768,0001,268,0002,170,880stderr
3Aug 18, 2026 01:201,95858,741,249144,431,0001,007,0002,170,880stderr
4Aug 18, 2026 01:201,96658,991,391143,604,0001,004,0002,170,880stderr
5Aug 18, 2026 01:201,97759,336,266146,053,0001,004,0002,170,880stderr
6Aug 18, 2026 01:201,98159,440,660146,448,0001,004,0002,170,880stderr
7Aug 18, 2026 01:201,99259,769,772145,907,0001,006,0002,170,880stderr
8Aug 18, 2026 01:202,01760,536,041148,997,0001,005,0002,170,880stderr
9Aug 18, 2026 01:202,01760,511,068149,068,0001,034,0002,170,880stderr