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 18, 2025 01:21Chandrasekaran AkashChandrasekaran AkashScore: 71,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 01:2170,75150,063,05124,165,0002,013,0002,445,312
2Apr 18, 2025 01:2070,89748,067,94824,215,0002,017,0002,441,216
3Apr 18, 2025 01:2170,93052,761,91425,235,0001,009,0002,527,232
4Apr 18, 2025 01:2070,97849,990,03825,252,0001,010,0002,531,328
5Apr 18, 2025 01:2171,07846,363,97826,299,00002,531,328
6Apr 18, 2025 01:2071,20048,622,26426,344,00002,445,312
7Apr 18, 2025 01:2171,24355,538,29826,360,00002,445,312
8Apr 18, 2025 01:2171,34152,973,01626,396,00002,531,328
9Apr 18, 2025 01:2173,42456,342,06625,155,0002,012,0002,433,024