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 listOct 12, 2025 20:49Martin StensgårdMartin StensgårdScore: 107,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 20:49107,18164,769,72738,641,0001,016,0002,260,992
2Oct 12, 2025 20:49107,52269,389,12737,794,0001,989,0002,371,584
3Oct 12, 2025 20:49107,64164,688,72438,832,000995,0002,502,656
4Oct 12, 2025 20:49107,68165,498,74937,850,0001,992,0002,260,992
5Oct 12, 2025 20:49107,70571,005,21737,859,0001,992,0002,392,064
6Oct 12, 2025 20:49107,83866,894,81237,905,0001,995,0002,379,776
7Oct 12, 2025 20:49108,21167,182,53939,038,0001,000,0002,506,752
8Oct 12, 2025 20:49108,30866,697,34239,073,0001,001,0002,379,776
9Oct 12, 2025 20:49108,33864,156,85139,083,0001,002,0002,519,040