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 06:07Andrew EpsteinAndrew EpsteinScore: 1,489Success
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 06:081,44943,476,67598,563,0001,209,0002,170,880stderr
2Oct 31, 2026 06:081,45443,642,10899,110,0001,261,0002,170,880stderr
3Oct 31, 2026 06:081,47544,260,767101,272,0001,193,0002,170,880stderr
4Oct 31, 2026 06:081,48844,652,001102,476,0001,294,0002,170,880stderr
5Oct 31, 2026 06:081,48944,697,784102,413,0001,216,0002,170,880stderr
6Oct 31, 2026 06:081,49244,778,291102,526,0001,110,0002,170,880stderr
7Oct 31, 2026 06:081,49844,941,104103,279,0001,211,0002,170,880stderr
8Oct 31, 2026 06:081,50645,185,978104,191,0001,011,0002,170,880stderr
9Oct 31, 2026 06:081,52045,609,633104,842,0001,262,0002,170,880stderr