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 listOct 19, 2026 05:11izotoffizotoffError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 05:13037,408,90825,901,0002,097,0002,138,112expected "429496503784 ", got "425201541149 "
2Oct 19, 2026 05:13037,925,33625,932,0002,126,0002,138,112expected "429496447539 ", got "339302244719 "
3Oct 19, 2026 05:13037,383,98425,882,0002,101,0002,138,112expected "429496485343 ", got "399431747895 "
4Oct 19, 2026 05:13038,020,66726,075,0002,126,0002,138,112expected "429496504459 ", got "386546880262 "
5Oct 19, 2026 05:1374,41336,898,19225,459,0002,074,0002,142,208stderr
6Oct 19, 2026 05:1374,87237,089,97825,619,0002,084,0002,142,208stderr
7Oct 19, 2026 05:1375,56237,388,81925,866,0002,092,0002,142,208stderr
8Oct 19, 2026 05:1375,77237,385,72225,943,0002,093,0002,142,208stderr
9Oct 19, 2026 05:1376,12737,561,34526,044,0002,123,0002,142,208stderr