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 19, 2026 02:25zayd-ansari-codezayd-ansari-codeScore: 22,388,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 02:2622,382,6218,293,117,4088,129,405,000152,165,0002,113,536
2Oct 19, 2026 02:2622,388,8918,295,849,5258,132,233,000151,657,0002,113,536
3Oct 19, 2026 02:2622,496,0868,334,702,9268,172,582,000150,970,0002,113,536