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 13, 2026 22:49olliecrowolliecrowScore: 60,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 22:4960,18447,575,96220,244,0002,024,0002,273,280
2Mar 13, 2026 22:4960,19749,441,44220,249,0002,024,0002,273,280
3Mar 13, 2026 22:4960,50544,466,44221,370,0001,017,0002,273,280