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 1, 2026 21:20olliecrowolliecrowScore: 72,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 21:2072,66851,895,17524,896,0001,991,0002,535,424
2Apr 1, 2026 21:2072,73250,292,05224,918,0001,993,0002,531,328
3Apr 1, 2026 21:2073,05146,853,35825,027,0002,002,0002,527,232