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,465Success
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 09:001,42942,877,25797,437,0001,139,0002,154,496stderr
2Oct 31, 2026 09:001,43342,991,50597,574,0001,245,0002,154,496stderr
3Oct 31, 2026 09:001,45143,556,93999,030,0001,240,0002,154,496stderr
4Oct 31, 2026 09:001,46443,934,190100,413,0001,180,0002,150,400stderr
5Oct 31, 2026 09:001,46543,960,062100,470,0001,166,0002,162,688stderr
6Oct 31, 2026 09:001,46643,992,228100,744,0001,187,0002,154,496stderr
7Oct 31, 2026 09:001,47544,274,925100,144,0001,287,0002,150,400stderr
8Oct 31, 2026 09:001,47944,389,820102,021,0001,158,0002,154,496stderr
9Oct 31, 2026 09:001,49844,940,399102,233,0002,302,0002,154,496stderr