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 21, 2026 15:08izotoffizotoffScore: 116,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 15:08116,59573,155,68742,137,0001,003,0002,342,912
2Mar 21, 2026 15:08116,84675,927,62140,217,0003,016,0002,371,584
3Mar 21, 2026 15:08118,48465,389,05042,843,000996,0002,359,296