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 18, 2025 16:36emily graceemily graceScore: 73,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 16:3672,84150,087,04224,955,0001,996,0002,289,664
2Apr 18, 2025 16:3672,95950,405,81824,996,0001,999,0002,281,472
3Apr 18, 2025 16:3673,05949,084,96925,030,0002,002,0002,289,664
4Apr 18, 2025 16:3673,07051,352,12525,034,0002,002,0002,289,664
5Apr 18, 2025 16:3673,15749,695,07625,063,0002,005,0002,289,664
6Apr 18, 2025 16:3673,30052,839,80225,112,0002,009,0002,277,376
7Apr 18, 2025 16:3673,38654,342,73225,142,0002,011,0002,289,664
8Apr 18, 2025 16:3673,40554,743,82025,149,0002,011,0002,289,664
9Apr 18, 2025 16:3673,57855,686,11825,208,0002,016,0002,281,472