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:49Andrew EpsteinAndrew EpsteinScore: 1,491Success
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 03:521,47244,175,429101,259,0001,162,0002,166,784
2Oct 31, 2026 03:521,47444,231,444101,574,0001,072,0002,166,784
3Oct 31, 2026 03:521,48244,462,217102,007,0001,139,0002,166,784
4Oct 31, 2026 03:521,48444,520,648102,143,0001,197,0002,166,784
5Oct 31, 2026 03:521,49144,747,450103,231,0001,028,0002,166,784
6Oct 31, 2026 03:521,50245,075,204103,992,0001,163,0002,166,784
7Oct 31, 2026 03:521,50345,104,544101,856,0001,185,0002,166,784
8Oct 31, 2026 03:521,51545,460,315105,260,0001,157,0002,166,784
9Oct 31, 2026 03:521,54746,439,825107,731,0001,097,0002,166,784