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 15, 2026 18:34Elijah KinElijah KinScore: 21,495,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 18:3421,411,4577,952,435,1807,717,414,000204,825,0002,277,376
2Mar 15, 2026 18:3421,412,4327,955,587,0167,718,791,000203,809,0002,351,104
3Mar 15, 2026 18:3421,457,9387,975,648,0457,744,599,000194,838,0002,277,376
4Mar 15, 2026 18:3421,463,5497,971,593,2757,737,680,000203,833,0002,277,376
5Mar 15, 2026 18:3421,495,1627,985,116,3707,751,383,000201,827,0002,277,376
6Mar 15, 2026 18:3421,518,1497,991,525,1147,769,867,000191,848,0002,293,760
7Mar 15, 2026 18:3421,565,9118,011,784,5037,776,556,000202,831,0002,277,376
8Mar 15, 2026 18:3421,577,1228,021,600,9047,787,694,000195,841,0002,277,376
9Mar 15, 2026 18:3421,587,3248,017,697,6417,790,475,000196,835,0002,277,376