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 08:53Andrew EpsteinAndrew EpsteinScore: 1,466Success
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 08:581,44943,499,66298,810,0001,269,0002,154,496stderr
2Oct 31, 2026 08:581,44943,470,51198,859,0001,206,0002,154,496stderr
3Oct 31, 2026 08:581,46043,800,54699,877,0001,204,0002,154,496stderr
4Oct 31, 2026 08:581,46343,897,952100,311,0001,164,0002,154,496stderr
5Oct 31, 2026 08:581,46643,985,867100,669,0001,139,0002,154,496stderr
6Oct 31, 2026 08:581,46944,078,639100,976,0001,080,0002,150,400stderr
7Oct 31, 2026 08:581,47044,107,596100,918,0001,220,0002,162,688stderr
8Oct 31, 2026 08:581,48244,481,169101,912,0001,207,0002,154,496stderr
9Oct 31, 2026 08:581,48644,588,272102,189,0001,193,0002,154,496stderr