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 05:34Andrew EpsteinAndrew EpsteinScore: 1,496Success
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 05:361,47644,297,628101,280,0001,216,0002,162,688stderr
2Oct 31, 2026 05:361,48844,668,292102,231,0001,265,0002,162,688stderr
3Oct 31, 2026 05:361,49444,832,365103,196,0001,166,0002,170,880stderr
4Oct 31, 2026 05:361,49544,873,461103,174,0001,233,0002,170,880stderr
5Oct 31, 2026 05:361,49644,895,906103,002,0001,207,0002,162,688stderr
6Oct 31, 2026 05:361,49844,954,726103,219,0001,165,0002,170,880stderr
7Oct 31, 2026 05:361,51745,515,064105,248,0001,119,0002,170,880stderr
8Oct 31, 2026 05:361,55246,578,172103,410,0001,198,0002,170,880stderr
9Oct 31, 2026 05:361,56546,963,175104,117,0001,231,0002,170,880stderr