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,494Success
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:411,48144,454,984102,697,0001,014,0002,170,880stderr
2Oct 31, 2026 05:411,48644,593,314102,750,0001,252,0002,170,880stderr
3Oct 31, 2026 05:411,48844,646,500100,306,0003,123,0002,170,880stderr
4Oct 31, 2026 05:411,49244,760,646101,457,0003,049,0002,170,880stderr
5Oct 31, 2026 05:411,49444,820,798103,641,0001,015,0002,162,688stderr
6Oct 31, 2026 05:411,50145,048,404102,540,0003,018,0002,162,688stderr
7Oct 31, 2026 05:411,50445,126,154103,065,0001,274,0002,162,688stderr
8Oct 31, 2026 05:411,50645,181,130102,909,0002,991,0002,162,688stderr
9Oct 31, 2026 05:411,51845,566,235104,900,0002,012,0002,162,688stderr