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 listJul 8, 2021 02:12Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 27, 2026 10:28wn321.90RecheckSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:29018,987,40901,449,0002,371,584expected "429496488423 ", got "209703661435 "
2Apr 27, 2026 10:29018,532,12201,440,0002,379,776expected "429496521956 ", got "222082543931 "
3Apr 27, 2026 10:29021,791,16901,423,0002,375,680expected "429496481663 ", got "225475328725 "
4Jul 8, 2021 02:122,99038,677,3241,106,42902,260,992
5Jul 8, 2021 02:123,03149,967,7691,121,43602,265,088
6Jul 8, 2021 02:123,03542,932,4251,122,81202,260,992