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 listMar 21, 2026 19:13izotoffizotoffScore: 77,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 19:1377,57858,744,78627,679,0001,025,0002,301,952
2Mar 21, 2026 19:1377,85456,009,38227,813,000993,0002,543,616
3Mar 21, 2026 19:1377,91152,954,85326,839,0001,988,0002,469,888
4Mar 21, 2026 19:1377,96256,274,22526,857,0001,989,0002,547,712
5Mar 21, 2026 19:1377,97357,040,76423,876,0004,974,0002,330,624
6Mar 21, 2026 19:1377,97657,963,85827,857,000994,0002,293,760
7Mar 21, 2026 19:1377,99258,354,16626,867,0001,990,0002,351,104
8Mar 21, 2026 19:1378,02759,179,12925,884,0002,986,0002,314,240
9Mar 21, 2026 19:1379,25454,648,08226,291,0003,033,0002,338,816