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 9, 2026 15:01olliecrowolliecrowScore: 60,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 15:0160,28645,652,09520,279,0002,027,0002,281,472
2Apr 9, 2026 15:0160,38645,226,51021,328,0001,015,0002,494,464
3Apr 9, 2026 15:0160,44144,308,55121,347,0001,016,0002,502,656