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 listFeb 5, 2026 21:04lipapipalipapipaScore: 78,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 21:0478,14954,915,78825,924,0002,991,0002,281,472
2Feb 5, 2026 21:0478,27855,251,16326,966,0001,997,0002,277,376
3Feb 5, 2026 21:0478,47353,481,18826,032,0003,003,0002,269,184
4Feb 5, 2026 21:0478,55954,861,36128,065,0001,002,0002,277,376
5Feb 5, 2026 21:0478,58656,869,98626,069,0003,008,0002,281,472
6Feb 5, 2026 21:0478,73862,333,11626,120,0003,013,0002,281,472
7Feb 5, 2026 21:0478,88652,006,31427,175,0002,013,0002,281,472
8Feb 5, 2026 21:0478,98950,303,65827,211,0002,015,0002,281,472
9Feb 5, 2026 21:0478,99259,792,23326,204,0003,023,0002,277,376