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 10:21Andrew EpsteinAndrew EpsteinScore: 1,552Success
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 10:261,52045,622,07198,590,0002,033,0002,179,072stderr
2Oct 31, 2026 10:261,54446,326,651100,935,0002,020,0002,179,072stderr
3Oct 31, 2026 10:261,54746,429,449101,095,0002,050,0002,179,072stderr
4Oct 31, 2026 10:261,54846,451,832101,088,0002,134,0002,183,168stderr
5Oct 31, 2026 10:261,55246,571,902101,165,0002,029,0002,179,072stderr
6Oct 31, 2026 10:261,55246,578,313101,457,0002,066,0002,179,072stderr
7Oct 31, 2026 10:261,55946,775,154101,880,0002,039,0002,183,168stderr
8Oct 31, 2026 10:261,56646,992,823103,943,0001,009,0002,179,072stderr
9Oct 31, 2026 10:261,61548,462,492102,754,0002,051,0002,179,072stderr