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 22:48olliecrowolliecrowScore: 69,897Success
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 22:4869,84151,535,34023,854,0001,987,0002,281,472
2Mar 4, 2026 22:4869,89753,689,45924,828,0001,034,0002,281,472
3Mar 4, 2026 22:4870,25451,578,26423,995,0001,999,0002,281,472