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 25, 2026 10:46Victor MerckléVictor MerckléScore: 93,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 10:4793,43742,228,13333,561,0001,011,0002,117,632stderr
2Jun 25, 2026 10:4793,46242,342,85733,549,0001,032,0002,117,632stderr
3Jun 25, 2026 10:4793,49442,608,71133,545,0001,048,0002,117,632stderr
4Jun 25, 2026 10:4793,53742,041,24734,609,00002,117,632stderr
5Jun 25, 2026 10:4793,56742,669,01733,602,0001,018,0002,117,632stderr
6Jun 25, 2026 10:4793,61042,257,72633,616,0001,020,0002,117,632stderr
7Jun 25, 2026 10:4793,82942,766,69633,691,0001,026,0002,117,632stderr
8Jun 25, 2026 10:4793,92442,242,71733,703,0001,049,0002,117,632stderr
9Jun 25, 2026 10:47182,26476,344,93066,381,0001,057,0002,117,632stderr