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 listApr 23, 2026 11:26Dominique GarmierDominique GarmierScore: 71,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 11:2771,40046,825,55225,402,0001,016,0002,387,968stderr
2Apr 23, 2026 11:2771,45643,524,09825,423,0001,016,0002,379,776stderr
3Apr 23, 2026 11:2771,45945,417,82025,424,0001,016,0002,379,776stderr
4Apr 23, 2026 11:2771,49444,017,56425,436,0001,017,0002,375,680stderr
5Apr 23, 2026 11:2771,59744,263,46925,473,0001,018,0002,445,312stderr
6Apr 23, 2026 11:2771,80044,013,43325,545,0001,021,0002,383,872stderr
7Apr 23, 2026 11:2771,85948,659,28225,566,0001,022,0002,379,776stderr
8Apr 23, 2026 11:2771,86741,189,74825,569,0001,022,0002,379,776stderr
9Apr 23, 2026 11:2771,98343,110,72225,610,0001,024,0002,326,528stderr