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:44Andrew EpsteinAndrew EpsteinScore: 1,488Success
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:471,46043,826,378100,385,0001,241,0002,170,880stderr
2Oct 31, 2026 05:471,47444,226,250101,704,0001,196,0002,162,688stderr
3Oct 31, 2026 05:471,47844,349,121101,976,0001,238,0002,170,880stderr
4Oct 31, 2026 05:471,48344,493,843102,058,0001,265,0002,170,880stderr
5Oct 31, 2026 05:471,48844,643,619102,845,0001,228,0002,170,880stderr
6Oct 31, 2026 05:471,48844,647,032102,943,0001,187,0002,162,688stderr
7Oct 31, 2026 05:471,50045,022,975104,067,0001,173,0002,162,688stderr
8Oct 31, 2026 05:471,50745,215,615104,414,0001,254,0002,162,688stderr
9Oct 31, 2026 05:471,50745,239,543104,659,0001,193,0002,162,688stderr