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 listJun 21, 2026 22:39A_ShamanA_ShamanScore: 1,905,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 22:411,115,627422,580,545226,567,000186,215,0002,113,536
2Jun 21, 2026 22:411,732,816650,472,324457,243,000183,899,0002,113,536
3Jun 21, 2026 22:411,804,535677,135,115482,123,000185,555,0002,113,536
4Jun 21, 2026 22:411,874,508703,147,298503,137,000190,431,0002,113,536
5Jun 21, 2026 22:411,905,589714,406,741516,661,000188,407,0002,113,536
6Jun 21, 2026 22:411,981,000742,363,038544,191,000188,779,0002,113,536
7Jun 21, 2026 22:411,985,145743,874,944548,594,000185,910,0002,113,536
8Jun 21, 2026 22:411,988,262745,232,059552,812,000182,845,0002,113,536
9Jun 21, 2026 22:412,021,829757,352,092564,815,000183,262,0002,113,536