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 07:48Andrew EpsteinAndrew EpsteinScore: 1,484Success
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 07:521,44943,474,70097,108,0002,076,0002,170,880stderr
2Oct 31, 2026 07:521,46643,981,07698,586,0001,997,0002,170,880stderr
3Oct 31, 2026 07:521,47344,207,231100,237,0001,208,0002,170,880stderr
4Oct 31, 2026 07:521,47644,298,552100,507,0001,002,0002,170,880stderr
5Oct 31, 2026 07:521,48444,533,00799,674,0001,004,0002,170,880stderr
6Oct 31, 2026 07:521,49144,747,986101,300,0002,102,0002,170,880stderr
7Oct 31, 2026 07:521,49244,761,191101,883,0001,025,0002,170,880stderr
8Oct 31, 2026 07:521,49444,844,563101,120,0002,090,0002,170,880stderr
9Oct 31, 2026 07:521,49444,845,616102,070,0001,213,0002,170,880stderr