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 listApr 14, 2025 12:58Yuriy LyfenkoYuriy LyfenkoScore: 59,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 12:5759,046544,775,93019,861,0001,986,0002,531,328
2Apr 14, 2025 12:5759,111542,047,16319,883,0001,988,0002,531,328
3Apr 14, 2025 12:5759,135544,873,05019,891,0001,989,0002,531,328
4Apr 14, 2025 12:5759,141543,498,41119,893,0001,989,0002,437,120
5Apr 14, 2025 12:5759,181547,853,77719,907,0001,990,0002,531,328
6Apr 14, 2025 12:5859,203548,639,90719,914,0001,991,0002,527,232
7Apr 14, 2025 12:5859,216544,360,01219,919,0001,991,0002,531,328
8Apr 14, 2025 12:5759,254545,023,42519,931,0001,993,0002,531,328
9Apr 14, 2025 12:5759,268544,663,51619,936,0001,993,0002,531,328
10Apr 14, 2025 12:5759,270543,253,01519,937,0001,993,0002,527,232
11Apr 14, 2025 12:5759,300543,097,35019,947,0001,994,0002,531,328
12Apr 14, 2025 12:5859,449540,220,61719,997,0001,999,0002,531,328