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:05Andrew EpsteinAndrew EpsteinScore: 1,485Success
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:061,45043,517,96899,220,0001,121,0002,170,880stderr
2Oct 31, 2026 06:061,46744,018,119100,553,0001,126,0002,170,880stderr
3Oct 31, 2026 06:061,47744,332,237101,590,0001,112,0002,170,880stderr
4Oct 31, 2026 06:061,48444,524,363102,898,0001,103,0002,162,688stderr
5Oct 31, 2026 06:061,48544,579,677102,088,0001,113,0002,170,880stderr
6Oct 31, 2026 06:061,48844,653,767102,741,0001,108,0002,170,880stderr
7Oct 31, 2026 06:061,49144,747,260102,806,0001,189,0002,170,880stderr
8Oct 31, 2026 06:061,49944,987,399103,588,0001,121,0002,170,880stderr
9Oct 31, 2026 06:061,57147,138,665105,678,0001,078,0002,174,976stderr