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 listMay 18, 2026 18:16M-RochatM-RochatScore: 59,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 18:1859,54831,853,28420,916,0001,117,0002,113,536
2May 18, 2026 18:1859,59433,054,05920,883,0001,167,0002,113,536
3May 18, 2026 18:1859,61633,083,65620,966,0001,092,0002,113,536
4May 18, 2026 18:1859,66731,430,78920,933,0001,144,0002,113,536
5May 18, 2026 18:1859,75131,247,74821,021,0001,087,0002,113,536
6May 18, 2026 18:1859,87831,803,33521,140,0001,015,0002,113,536
7May 18, 2026 18:1859,90031,387,21821,001,0001,162,0002,113,536
8May 18, 2026 18:1860,04332,314,60021,098,0001,118,0002,113,536
9May 18, 2026 18:1860,21632,744,96021,085,0001,195,0002,113,536