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 22:55lipapipalipapipaScore: 61,770Success
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 22:5561,39548,942,07922,716,00002,277,376
2Feb 5, 2026 22:5561,71947,311,17121,844,000992,0002,404,352
3Feb 5, 2026 22:5561,72745,998,12720,853,0001,986,0002,400,256
4Feb 5, 2026 22:5561,74150,854,49821,851,000993,0002,392,064
5Feb 5, 2026 22:5561,77051,142,04920,868,0001,987,0002,277,376
6Feb 5, 2026 22:5561,87050,988,32221,897,000995,0002,277,376
7Feb 5, 2026 22:5561,88948,366,63120,908,0001,991,0002,408,448
8Feb 5, 2026 22:5561,89547,429,32121,906,000995,0002,277,376
9Feb 5, 2026 22:5562,04154,767,12021,957,000998,0002,277,376