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 09:38Andrew EpsteinAndrew EpsteinScore: 1,557Success
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 09:471,53946,180,87099,102,0002,012,0002,183,168stderr
2Oct 31, 2026 09:471,54046,217,289100,173,0002,048,0002,183,168stderr
3Oct 31, 2026 09:471,54646,386,858100,667,0002,038,0002,224,128stderr
4Oct 31, 2026 09:471,55146,533,845101,664,0002,041,0002,179,072stderr
5Oct 31, 2026 09:471,55746,733,702101,612,0002,043,0002,183,168stderr
6Oct 31, 2026 09:471,55746,734,693103,179,0001,008,0002,179,072stderr
7Oct 31, 2026 09:471,55946,775,712102,068,0002,014,0002,183,168stderr
8Oct 31, 2026 09:471,59347,797,541100,670,0002,027,0002,179,072stderr
9Oct 31, 2026 09:471,86656,002,305101,314,0002,185,0002,183,168stderr