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 listJun 24, 2026 18:57Victor MerckléVictor MerckléScore: 74,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:5874,59136,796,64426,425,0001,174,0002,146,304
2Jun 24, 2026 18:5874,70236,847,12026,465,0001,175,0002,146,304
3Jun 24, 2026 18:5874,84536,933,69626,606,0001,087,0002,146,304
4Jun 24, 2026 18:5874,86237,013,55226,651,0001,048,0002,146,304
5Jun 24, 2026 18:5874,94336,957,89926,530,0001,199,0002,146,304
6Jun 24, 2026 18:5875,03237,002,36726,694,0001,068,0002,146,304
7Jun 24, 2026 18:5875,13237,016,42126,713,0001,086,0002,146,304
8Jun 24, 2026 18:5875,13537,143,68126,723,0001,077,0002,146,304
9Jun 24, 2026 18:5875,23537,021,13626,774,0001,063,0002,146,304