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 listJan 19, 2025 09:14Ian MckibbenIan MckibbenScore: 70,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 09:1470,57650,679,10725,109,0001,004,0002,531,328
2Jan 19, 2025 09:1470,63846,569,17025,131,0001,005,0002,531,328
3Jan 19, 2025 09:1470,68447,501,45925,148,0001,005,0002,510,848
4Jan 19, 2025 09:1470,78946,230,79025,185,0001,007,0002,531,328
5Jan 19, 2025 09:1470,87645,896,98524,207,0002,017,0002,433,024
6Jan 19, 2025 09:1471,03548,072,41825,273,0001,010,0002,433,024
7Jan 19, 2025 09:1471,08448,836,66926,301,00002,531,328
8Jan 19, 2025 09:1471,17344,755,54225,322,0001,012,0002,531,328
9Jan 19, 2025 09:1471,39248,052,32726,415,00002,531,328