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 listJul 6, 2026 17:13IlyaIlyaScore: 59,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:1558,91631,413,06620,689,0001,110,0002,113,536
2Jul 6, 2026 17:1558,94031,388,99420,671,0001,137,0002,113,536
3Jul 6, 2026 17:1559,05131,487,26420,659,0001,190,0002,113,536
4Jul 6, 2026 17:1559,06231,469,66320,705,0001,148,0002,113,536
5Jul 6, 2026 17:1559,07531,475,78020,735,0001,123,0002,113,536
6Jul 6, 2026 17:1559,10836,614,95520,683,0001,187,0002,113,536
7Jul 6, 2026 17:1559,18331,531,66320,668,0001,230,0002,113,536
8Jul 6, 2026 17:1559,38132,140,39720,750,0001,221,0002,113,536
9Jul 6, 2026 17:1559,74331,636,49120,917,0001,188,0002,113,536