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:23Andrew EpsteinAndrew EpsteinScore: 1,874Success
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:271,82454,737,013125,984,0001,061,0002,174,976
2Oct 31, 2026 02:271,83054,908,204125,288,0001,050,0002,174,976
3Oct 31, 2026 02:271,83355,006,244124,572,0002,094,0002,220,032
4Oct 31, 2026 02:271,84755,421,767125,106,0001,072,0002,174,976
5Oct 31, 2026 02:271,87456,242,057129,338,0001,057,0002,174,976
6Oct 31, 2026 02:271,88356,507,554126,820,0001,052,0002,174,976
7Oct 31, 2026 02:271,88956,698,006126,727,0001,080,0002,174,976
8Oct 31, 2026 02:271,89456,843,949129,686,0001,078,0002,174,976
9Oct 31, 2026 02:272,33970,187,052130,544,0002,216,0002,220,032