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 3, 2026 22:30olliecrowolliecrowScore: 107,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:30107,70371,037,19137,858,0001,992,0002,400,256
2Mar 3, 2026 22:30107,84366,192,18037,907,0001,995,0002,277,376
3Mar 3, 2026 22:30108,59566,050,49138,171,0002,009,0002,277,376