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:34Andrew EpsteinAndrew EpsteinScore: 1,549Success
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:381,54046,228,641100,726,0002,026,0002,224,128stderr
2Oct 31, 2026 09:381,54346,310,277100,977,0002,017,0002,179,072stderr
3Oct 31, 2026 09:381,54746,412,062101,197,0002,002,0002,191,360stderr
4Oct 31, 2026 09:381,54846,456,434102,248,0002,002,0002,179,072stderr
5Oct 31, 2026 09:381,54946,485,827101,405,0002,016,0002,183,168stderr
6Oct 31, 2026 09:381,55246,573,601101,197,0002,025,0002,183,168stderr
7Oct 31, 2026 09:381,55746,711,028102,024,0002,077,0002,179,072stderr
8Oct 31, 2026 09:381,56446,927,938103,969,0001,009,0002,183,168stderr
9Oct 31, 2026 09:381,88256,468,772113,897,0002,131,0002,179,072stderr