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 26, 2026 18:54Charles CabergsCharles CabergsScore: 71,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:5670,95641,898,26024,235,0002,019,0002,359,296
2Apr 26, 2026 18:5670,97542,764,20825,251,0001,010,0002,355,200
3Apr 26, 2026 18:5670,98340,790,06826,264,00002,359,296
4Apr 26, 2026 18:5671,05645,423,41925,280,0001,011,0002,359,296
5Apr 26, 2026 18:5671,10545,358,97024,286,0002,023,0002,347,008
6Apr 26, 2026 18:5671,15942,139,57825,317,0001,012,0002,306,048
7Apr 26, 2026 18:5671,15943,120,74925,317,0001,012,0002,371,584
8Apr 26, 2026 18:5671,40043,876,33825,402,0001,016,0002,310,144
9Apr 26, 2026 18:5671,40543,135,75625,404,0001,016,0002,359,296