TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listNov 23, 2024 16:46E SequeiraE SequeiraScore: 450,811Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 16:46450,314195,059,918166,616,00002,265,088
2Nov 23, 2024 16:46450,365196,311,128165,632,0001,003,0002,289,664
3Nov 23, 2024 16:46450,459196,907,857165,666,0001,004,0002,289,664
4Nov 23, 2024 16:46450,714190,825,957164,767,0001,997,0002,351,104
5Nov 23, 2024 16:46450,811197,817,306165,802,000998,0002,289,664
6Nov 23, 2024 16:46450,838196,787,254164,813,0001,997,0002,281,472
7Nov 23, 2024 16:46450,868198,864,227165,823,000998,0002,289,664
8Nov 23, 2024 16:46450,962198,821,167164,858,0001,998,0002,289,664
9Nov 23, 2024 16:46451,646190,729,744164,108,0003,001,0002,289,664