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 listOct 31, 2026 06:48Andrew EpsteinAndrew EpsteinScore: 1,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 06:581,46644,006,052101,142,0001,036,0002,150,400stderr
2Oct 31, 2026 06:581,47144,142,79399,542,0003,031,0002,158,592stderr
3Oct 31, 2026 06:581,47844,349,497102,410,0001,017,0002,150,400stderr
4Oct 31, 2026 06:581,48244,465,985102,713,0001,011,0002,154,496stderr
5Oct 31, 2026 06:581,48444,538,982102,921,0001,010,0002,162,688stderr
6Oct 31, 2026 06:581,48544,557,212102,998,0001,040,0002,162,688stderr
7Oct 31, 2026 06:581,49944,995,237104,446,0001,030,0002,170,880stderr
8Oct 31, 2026 06:581,50345,116,158100,253,0001,026,0002,158,592stderr
9Oct 31, 2026 06:581,50945,272,597105,244,0001,037,0002,154,496stderr