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 09:56Andrew EpsteinAndrew EpsteinScore: 1,554Success
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 10:021,51645,498,28298,042,0002,037,0002,224,128stderr
2Oct 31, 2026 10:021,53846,150,678100,572,0002,017,0002,179,072stderr
3Oct 31, 2026 10:021,54546,353,015100,575,0002,160,0002,183,168stderr
4Oct 31, 2026 10:021,55446,624,517101,475,0002,177,0002,179,072stderr
5Oct 31, 2026 10:021,55446,622,693101,543,0002,015,0002,224,128stderr
6Oct 31, 2026 10:021,55546,656,875101,429,0002,050,0002,191,360stderr
7Oct 31, 2026 10:021,55746,718,047102,012,0002,159,0002,179,072stderr
8Oct 31, 2026 10:021,56646,988,882102,545,0002,007,0002,183,168stderr
9Oct 31, 2026 10:021,62848,861,417103,620,0002,015,0002,179,072stderr