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 3, 2026 23:42olliecrowolliecrowScore: 69,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:4269,87652,198,72424,860,000994,0002,277,376
2Mar 3, 2026 23:4269,88452,568,23324,863,000994,0002,277,376
3Mar 3, 2026 23:4269,90350,898,49023,875,0001,989,0002,404,352
4Mar 3, 2026 23:4269,90854,148,90423,877,0001,989,0002,277,376
5Mar 3, 2026 23:4269,92751,135,48123,883,0001,990,0002,277,376
6Mar 3, 2026 23:4269,97055,735,23925,889,00002,400,256
7Mar 3, 2026 23:4270,15451,411,62824,959,000998,0002,277,376
8Mar 3, 2026 23:4270,51650,691,43224,084,0002,007,0002,277,376
9Mar 3, 2026 23:4270,52253,307,76625,090,0001,003,0002,277,376