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:08Andrew EpsteinAndrew EpsteinScore: 1,469Success
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:121,44743,430,54798,964,0001,138,0002,154,496stderr
2Oct 31, 2026 09:121,45843,768,63499,871,0001,188,0002,154,496stderr
3Oct 31, 2026 09:121,46343,914,49499,601,0001,134,0002,154,496stderr
4Oct 31, 2026 09:121,46744,010,011100,716,0001,195,0002,162,688stderr
5Oct 31, 2026 09:121,46944,080,854100,840,0001,141,0002,154,496stderr
6Oct 31, 2026 09:121,77653,283,23498,260,0001,032,0002,154,496stderr
7Oct 31, 2026 09:121,91757,523,035116,942,0003,029,0002,170,880stderr
8Oct 31, 2026 09:121,95158,550,327119,883,0003,042,0002,170,880stderr
9Oct 31, 2026 09:121,99159,741,883125,057,0003,034,0002,150,400stderr