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 listAug 14, 2026 22:34Tomislav TunkovicTomislav TunkovicScore: 1,060,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 22:351,058,735400,155,795388,566,0003,166,0002,121,728stderr
2Aug 14, 2026 22:351,058,897400,174,126388,561,0003,231,0002,121,728stderr
3Aug 14, 2026 22:351,059,481400,297,279388,707,0003,301,0002,121,728stderr
4Aug 14, 2026 22:351,059,829400,528,397388,918,0003,219,0002,121,728stderr
5Aug 14, 2026 22:351,060,462400,750,897389,131,0003,240,0002,121,728stderr
6Aug 14, 2026 22:351,061,248400,992,029389,418,0003,244,0002,121,728stderr
7Aug 14, 2026 22:351,062,872401,609,524390,008,0003,255,0002,121,728stderr
8Aug 14, 2026 22:351,063,108401,726,505390,070,0003,280,0002,121,728stderr
9Aug 14, 2026 22:351,063,729402,479,273390,306,0003,274,0002,121,728stderr