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 23, 2026 15:20Victor MerckléVictor MerckléScore: 2,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 15:212,21566,457,179166,533,0001,028,0002,170,880stderr
2Aug 23, 2026 15:212,22766,833,844167,861,0001,032,0002,170,880stderr
3Aug 23, 2026 15:212,23367,017,164165,551,0001,023,0002,170,880stderr
4Aug 23, 2026 15:212,23467,039,510166,846,0002,005,0002,170,880stderr
5Aug 23, 2026 15:212,24267,263,265168,009,0002,009,0002,170,880stderr
6Aug 23, 2026 15:212,24967,486,458169,720,0002,014,0002,170,880stderr
7Aug 23, 2026 15:212,26567,951,764169,552,0002,041,0002,170,880stderr
8Aug 23, 2026 15:212,28968,674,135173,908,0002,047,0002,170,880stderr
9Aug 23, 2026 15:212,37471,235,570182,003,0001,292,0002,170,880stderr