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 listFeb 11, 2026 12:13Alex KentAlex KentScore: 20,934,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 12:1320,848,3117,744,942,5237,566,992,000146,883,0002,310,144
2Feb 11, 2026 12:1320,848,9687,747,745,4077,566,231,000147,887,0002,281,472
3Feb 11, 2026 12:1320,865,8387,751,773,9987,575,485,000144,875,0002,277,376
4Feb 11, 2026 12:1320,909,9767,768,341,1957,585,815,000150,876,0002,281,472
5Feb 11, 2026 12:1320,934,3437,779,329,0187,598,846,000146,861,0002,281,472
6Feb 11, 2026 12:1320,956,7597,786,246,8647,607,134,000146,867,0002,281,472
7Feb 11, 2026 12:1320,982,1307,793,753,7787,619,511,000143,877,0002,301,952
8Feb 11, 2026 12:1321,054,6547,826,501,6897,644,349,000145,873,0002,281,472
9Feb 11, 2026 12:1321,065,6737,827,941,8137,647,426,000146,873,0002,281,472