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 listApr 29, 2026 11:32Dominique GarmierDominique GarmierScore: 70,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 11:3470,01341,418,32223,913,0001,992,0002,379,776
2Apr 29, 2026 11:3470,60843,146,99124,116,0002,009,0002,383,872
3Apr 29, 2026 11:3470,63742,340,84824,126,0002,010,0002,387,968
4Apr 29, 2026 11:3470,70041,665,57424,147,0002,012,0002,387,968
5Apr 29, 2026 11:3470,84540,608,95925,205,0001,008,0002,383,872
6Apr 29, 2026 11:3470,90040,055,83226,233,00002,326,528
7Apr 29, 2026 11:3471,05142,504,52225,278,0001,011,0002,383,872
8Apr 29, 2026 11:3471,13240,964,19525,307,0001,012,0002,383,872
9Apr 29, 2026 11:3471,33243,262,53125,378,0001,015,0002,371,584