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 listJun 30, 2026 22:15IlyaIlyaScore: 58,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:1958,65432,472,11020,594,0001,108,0002,113,536
2Jun 30, 2026 22:1958,67031,211,89120,604,0001,104,0002,113,536
3Jun 30, 2026 22:1958,82731,229,33120,659,0001,107,0002,113,536
4Jun 30, 2026 22:1958,94331,779,07020,586,0001,223,0002,113,536
5Jun 30, 2026 22:1958,97031,356,73120,673,0001,146,0002,113,536
6Jun 30, 2026 22:1958,97231,307,65820,626,0001,194,0002,113,536
7Jun 30, 2026 22:1921,651,2548,020,801,2997,851,982,000158,982,0002,113,536
8Jun 30, 2026 22:1921,685,7758,033,738,1587,869,423,000154,314,0002,113,536
9Jun 30, 2026 22:1921,726,8168,048,914,6147,880,982,000157,940,0002,113,536