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:01Andrew EpsteinAndrew EpsteinScore: 1,505Success
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:101,49544,875,650103,506,0001,011,0002,170,880
2Oct 31, 2026 04:101,49544,854,061103,646,0001,014,0002,170,880
3Oct 31, 2026 04:101,50145,053,363103,530,0001,282,0002,170,880
4Oct 31, 2026 04:101,50445,125,663104,743,0001,018,0002,162,688
5Oct 31, 2026 04:101,50545,169,252104,496,0001,021,0002,162,688
6Oct 31, 2026 04:101,50845,261,277103,438,0002,034,0002,170,880
7Oct 31, 2026 04:101,51145,357,119103,549,0002,011,0002,170,880
8Oct 31, 2026 04:101,51545,455,615105,633,0001,017,0002,170,880
9Oct 31, 2026 04:101,52445,737,301106,206,0001,018,0002,170,880