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 listNov 9, 2025 16:01Yehor BondarYehor BondarScore: 21,483,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2025 16:0121,379,8847,945,058,7847,726,730,000183,827,0002,277,376
2Nov 9, 2025 16:0121,456,1767,974,367,6897,751,955,000186,830,0002,277,376
3Nov 9, 2025 16:0121,461,6897,973,070,9067,750,997,000189,828,0002,306,048
4Nov 9, 2025 16:0121,470,8957,978,623,8057,746,400,000197,831,0002,277,376
5Nov 9, 2025 16:0121,483,3037,989,995,6857,741,010,000207,812,0002,277,376
6Nov 9, 2025 16:0121,487,4627,981,699,7037,754,525,000195,836,0002,277,376
7Nov 9, 2025 16:0121,515,3977,998,875,5727,762,854,000197,843,0002,306,048
8Nov 9, 2025 16:0121,567,4518,007,514,9717,787,128,000192,829,0002,277,376
9Nov 9, 2025 16:0121,605,9848,023,636,1797,804,376,000189,838,0002,277,376