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 4, 2026 05:22olliecrowolliecrowScore: 70,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 05:2269,91451,846,18423,879,0001,989,0002,396,160
2Mar 4, 2026 05:2270,19253,979,05223,974,0001,997,0002,277,376
3Mar 4, 2026 05:2270,25755,346,11723,996,0001,999,0002,277,376