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 04:34Andrew EpsteinAndrew EpsteinScore: 1,492Success
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:371,48344,496,483101,764,0001,167,0002,166,784
2Oct 31, 2026 04:371,48744,633,070102,344,0001,134,0002,166,784
3Oct 31, 2026 04:371,48844,652,057102,523,0001,215,0002,166,784
4Oct 31, 2026 04:371,48844,659,448102,678,0001,087,0002,166,784
5Oct 31, 2026 04:371,49244,785,927102,740,0001,068,0002,166,784
6Oct 31, 2026 04:371,50145,050,789103,650,0001,117,0002,166,784
7Oct 31, 2026 04:371,51645,508,001104,582,0001,140,0002,166,784
8Oct 31, 2026 04:371,52545,767,769105,754,0001,146,0002,166,784
9Oct 31, 2026 04:371,53045,903,728106,279,0001,188,0002,166,784