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 11, 2025 21:42Drew GarciaDrew GarciaScore: 128,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 21:42125,00069,901,49042,229,0004,021,0002,281,472
2Apr 11, 2025 21:42126,57077,043,84845,835,000996,0002,281,472
3Apr 11, 2025 21:42127,34170,909,51144,109,0003,007,0002,269,184
4Apr 11, 2025 21:42128,26268,945,71845,438,0002,019,0002,367,488
5Apr 11, 2025 21:42128,29271,227,10345,449,0002,019,0002,281,472
6Apr 11, 2025 21:42129,89776,093,87146,060,0002,002,0002,281,472
7Apr 11, 2025 21:42130,34971,468,28746,220,0002,009,0002,281,472
8Apr 11, 2025 21:42130,55772,521,36446,294,0002,012,0002,281,472
9Apr 11, 2025 21:42131,50877,061,94348,658,00002,273,280