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,516Success
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:511,48844,664,095102,323,0001,205,0002,166,784
2Oct 31, 2026 03:511,49544,866,348103,043,0001,159,0002,158,592
3Oct 31, 2026 03:511,49944,973,136103,236,0001,158,0002,166,784
4Oct 31, 2026 03:511,51545,475,006105,652,0001,060,0002,166,784
5Oct 31, 2026 03:511,51645,499,479105,216,0001,096,0002,166,784
6Oct 31, 2026 03:511,51745,523,273105,159,0001,156,0002,166,784
7Oct 31, 2026 03:511,52245,672,098105,327,0001,124,0002,166,784
8Oct 31, 2026 03:511,53646,108,712106,605,0001,158,0002,166,784
9Oct 31, 2026 03:511,53646,093,287106,675,0001,163,0002,166,784