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 07:33Andrew EpsteinAndrew EpsteinScore: 1,486Success
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 07:351,45643,680,07399,550,0001,211,0002,170,880stderr
2Oct 31, 2026 07:351,46844,040,800100,484,0001,211,0002,150,400stderr
3Oct 31, 2026 07:351,47444,238,368101,307,0001,014,0002,154,496stderr
4Oct 31, 2026 07:351,47844,367,446101,843,0001,123,0002,150,400stderr
5Oct 31, 2026 07:351,48644,581,046102,358,0001,178,0002,154,496stderr
6Oct 31, 2026 07:351,49144,737,046102,723,0001,010,0002,158,592stderr
7Oct 31, 2026 07:351,49644,897,640103,465,0001,010,0002,154,496stderr
8Oct 31, 2026 07:351,50645,190,580103,776,0001,281,0002,150,400stderr
9Oct 31, 2026 07:351,51645,496,997105,278,0001,026,0002,154,496stderr