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 06:34Andrew EpsteinAndrew EpsteinScore: 1,472Success
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 06:371,43643,094,21697,920,0001,139,0002,154,496stderr
2Oct 31, 2026 06:371,44543,361,08098,582,0001,171,0002,170,880stderr
3Oct 31, 2026 06:371,45943,791,00399,735,0001,219,0002,154,496stderr
4Oct 31, 2026 06:371,46243,880,991100,067,0001,173,0002,150,400stderr
5Oct 31, 2026 06:371,47244,179,205101,009,0001,156,0002,170,880stderr
6Oct 31, 2026 06:371,47644,281,372101,474,0001,034,0002,170,880stderr
7Oct 31, 2026 06:371,48444,545,090102,113,0001,036,0002,162,688stderr
8Oct 31, 2026 06:371,49144,738,929102,835,0001,016,0002,150,400stderr
9Oct 31, 2026 06:371,49444,836,843102,988,0001,010,0002,150,400stderr