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 04:13Andrew EpsteinAndrew EpsteinScore: 2,264Success
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 04:222,24567,352,090162,012,0002,127,0002,158,592
2Oct 31, 2026 04:222,26067,826,302163,360,0002,123,0002,158,592
3Oct 31, 2026 04:222,26167,859,876164,851,0001,046,0002,420,736
4Oct 31, 2026 04:222,26167,858,246163,413,0002,122,0002,158,592
5Oct 31, 2026 04:222,26467,932,111163,557,0002,107,0002,162,688
6Oct 31, 2026 04:222,26667,983,866163,356,0002,128,0002,420,736
7Oct 31, 2026 04:222,26768,023,050163,624,0002,204,0002,162,688
8Oct 31, 2026 04:222,27168,137,658164,115,0002,063,0002,465,792
9Oct 31, 2026 04:222,28368,490,411163,269,0002,123,0002,158,592