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 02:00Andrew EpsteinAndrew EpsteinScore: 1,593Success
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 02:011,58547,562,370104,503,0001,022,0002,174,976stderr
2Oct 31, 2026 02:011,59147,756,561104,064,0001,022,0002,174,976stderr
3Oct 31, 2026 02:011,59147,741,579102,462,0001,022,0002,174,976stderr
4Oct 31, 2026 02:011,59247,777,351103,864,0001,012,0002,166,784stderr
5Oct 31, 2026 02:011,59347,801,863104,429,0001,023,0002,174,976stderr
6Oct 31, 2026 02:011,60748,234,095102,544,0001,025,0002,174,976stderr
7Oct 31, 2026 02:011,61648,489,409106,745,0001,007,0002,166,784stderr
8Oct 31, 2026 02:011,65949,787,719104,618,0002,064,0002,174,976stderr
9Oct 31, 2026 02:011,66649,980,143105,454,0001,020,0002,162,688stderr