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 03:58Andrew EpsteinAndrew EpsteinScore: 1,498Success
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:041,47344,195,170101,132,0001,119,0002,166,784
2Oct 31, 2026 04:041,48044,410,280101,379,0001,234,0002,166,784
3Oct 31, 2026 04:041,48044,422,645101,928,0001,172,0002,166,784
4Oct 31, 2026 04:041,49444,833,049103,409,0001,142,0002,158,592
5Oct 31, 2026 04:041,49844,940,278102,922,0001,171,0002,158,592
6Oct 31, 2026 04:041,49944,977,298103,457,0001,162,0002,158,592
7Oct 31, 2026 04:041,50145,054,710103,386,0001,211,0002,166,784
8Oct 31, 2026 04:041,51045,312,056105,266,0001,066,0002,166,784
9Oct 31, 2026 04:041,51445,420,973105,096,0001,161,0002,166,784