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 16, 2026 22:36izotoffizotoffScore: 139,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:36139,45982,051,92549,577,0002,023,0002,383,872
2Mar 16, 2026 22:36139,56579,353,68949,614,0002,025,0002,314,240
3Mar 16, 2026 22:36140,09779,495,31750,840,000996,0002,392,064