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 listApr 26, 2026 19:04TudyMTudyMScore: 124,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 19:04124,05665,639,31143,906,0001,995,0002,297,856
2Apr 26, 2026 19:04124,11663,670,82943,927,0001,996,0002,301,952
3Apr 26, 2026 19:04124,36261,931,65644,014,0002,000,0002,355,200
4Apr 26, 2026 19:04124,57860,674,61744,090,0002,004,0002,433,024
5Apr 26, 2026 19:04124,72460,302,32644,142,0002,006,0002,461,696
6Apr 26, 2026 19:04125,12763,876,27745,291,0001,006,0002,379,776
7Apr 26, 2026 19:04125,24862,151,98944,328,0002,014,0002,367,488
8Apr 26, 2026 19:04125,28371,213,55245,348,0001,007,0002,367,488
9Apr 26, 2026 19:04125,50863,366,34845,429,0001,009,0002,367,488