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 16, 2026 21:21olliecrowolliecrowScore: 110,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 21:21109,81465,302,36540,631,00002,371,584
2Apr 16, 2026 21:21110,40367,500,56140,849,00002,363,392
3Apr 16, 2026 21:21112,49274,259,30141,622,00002,363,392