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 listMay 5, 2026 17:41Hung T.NguyenHung T.NguyenScore: 79,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 17:4178,70848,550,62428,079,0001,043,0002,379,776
2May 5, 2026 17:4179,01845,787,47828,185,0001,052,0002,371,584
3May 5, 2026 17:4179,25447,458,49328,265,0001,059,0002,379,776