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 15, 2026 18:37Elijah KinElijah KinScore: 21,346,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 18:3721,220,3007,883,767,2757,648,679,000202,832,0002,277,376
2Mar 15, 2026 18:3721,235,7227,896,480,0717,656,391,000200,826,0002,277,376
3Mar 15, 2026 18:3721,274,1117,904,691,3667,676,584,000194,837,0002,277,376
4Mar 15, 2026 18:3721,281,0767,906,570,7157,667,182,000206,816,0002,277,376
5Mar 15, 2026 18:3721,346,6007,928,400,2847,702,410,000195,832,0002,314,240
6Mar 15, 2026 18:3721,378,6817,944,599,3507,697,298,000212,814,0002,277,376
7Mar 15, 2026 18:3721,384,8197,948,901,6317,706,556,000205,827,0002,277,376
8Mar 15, 2026 18:3721,405,2057,951,320,1787,722,078,000197,848,0002,277,376
9Mar 15, 2026 18:3721,423,3577,957,779,6027,730,800,000195,842,0002,301,952