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 30, 2026 05:04limanjun99limanjun99Score: 61,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 05:0461,77049,799,41520,868,0001,987,0002,273,280
2Mar 30, 2026 05:0461,78455,114,79320,873,0001,987,0002,281,472
3Mar 30, 2026 05:0461,80844,046,71221,875,000994,0002,281,472
4Mar 30, 2026 05:0461,81443,419,19121,877,000994,0002,392,064
5Mar 30, 2026 05:0461,94644,701,57421,924,000996,0002,392,064
6Mar 30, 2026 05:0462,00845,629,16520,948,0001,995,0002,400,256
7Mar 30, 2026 05:0463,80550,608,50023,608,00002,281,472
8Mar 30, 2026 05:0465,24652,643,48823,136,0001,005,0002,281,472
9Mar 30, 2026 05:0467,97850,549,36523,140,0002,012,0002,404,352