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 08:15Andrew EpsteinAndrew EpsteinScore: 1,493Success
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 08:211,45943,792,12999,930,0001,127,0002,154,496stderr
2Oct 31, 2026 08:211,46143,843,873100,145,0001,041,0002,162,688stderr
3Oct 31, 2026 08:211,47744,318,853100,239,0002,279,0002,150,400stderr
4Oct 31, 2026 08:211,48244,482,472100,968,0002,039,0002,154,496stderr
5Oct 31, 2026 08:211,49344,804,858103,206,0001,014,0002,154,496stderr
6Oct 31, 2026 08:211,49644,885,205102,876,0001,276,0002,154,496stderr
7Oct 31, 2026 08:211,50245,074,255103,459,0001,280,0002,150,400stderr
8Oct 31, 2026 08:211,51345,402,886104,732,0001,197,0002,150,400stderr
9Oct 31, 2026 08:211,58547,565,669105,986,0001,033,0002,154,496stderr