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 02:38Andrew EpsteinAndrew EpsteinScore: 1,609Success
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 02:471,55546,663,73799,626,0001,014,0002,174,976
2Oct 31, 2026 02:471,58547,571,433101,696,0001,073,0002,174,976
3Oct 31, 2026 02:471,59247,768,713101,779,0003,016,0002,162,688
4Oct 31, 2026 02:471,60748,231,607103,010,0002,148,0002,162,688
5Oct 31, 2026 02:471,60948,284,313102,602,0001,076,0002,174,976
6Oct 31, 2026 02:471,62248,667,078104,633,0002,148,0002,162,688
7Oct 31, 2026 02:471,62648,797,624103,624,0001,079,0002,174,976
8Oct 31, 2026 02:471,63349,009,175105,411,0002,008,0002,174,976
9Oct 31, 2026 02:471,64349,305,809107,390,0001,068,0002,174,976