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 20, 2026 17:48olliecrowolliecrowScore: 102,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 17:48101,37665,905,59236,496,0001,013,0002,342,912
2Mar 20, 2026 17:48102,26567,569,50235,847,0001,991,0002,437,120
3Mar 20, 2026 17:48102,57359,553,06035,955,0001,997,0002,342,912