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 listJan 19, 2025 07:49Ian MckibbenIan MckibbenScore: 71,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 07:4970,65744,336,47225,138,0001,005,0002,269,184
2Jan 19, 2025 07:4971,23554,624,32824,330,0002,027,0002,531,328
3Jan 19, 2025 07:4971,25147,921,78226,363,00002,428,928
4Jan 19, 2025 07:4971,30351,726,17726,382,00002,531,328
5Jan 19, 2025 07:4971,35949,327,97426,403,00002,433,024
6Jan 19, 2025 07:4971,42750,701,44026,428,00002,531,328
7Jan 19, 2025 07:4971,43849,755,73326,432,00002,531,328
8Jan 19, 2025 07:4971,82759,720,98126,576,00002,433,024
9Jan 19, 2025 07:4971,85150,959,52826,585,00002,510,848