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 listOct 19, 2026 06:11izotoffizotoffError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 06:11037,338,10225,748,0002,215,0002,142,208expected "429496507036 ", got "8589934478 "stderr
2Oct 19, 2026 06:11036,915,25925,465,0002,072,0002,142,208expected "429496495101 ", got "21474836170 "stderr
3Oct 19, 2026 06:11037,405,92025,932,0002,089,0002,142,208expected "429496536954 ", got "8589934408 "stderr