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 16, 2026 22:44izotoffizotoffScore: 123,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:44123,19273,779,01844,569,0001,012,0002,314,240
2Mar 16, 2026 22:44123,87374,935,87244,837,000996,0002,314,240
3Mar 16, 2026 22:44124,40578,008,71244,029,0002,001,0002,379,776