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 21, 2025 13:54thatmagicalcatthatmagicalcatScore: 112,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 13:54111,90064,586,52840,394,0001,009,0002,367,488
2Jun 21, 2025 13:54111,99268,237,17140,427,0001,010,0002,363,392
3Jun 21, 2025 13:54112,14963,324,75541,495,00002,367,488
4Jun 21, 2025 13:54112,25964,465,91041,536,00002,351,104
5Jun 21, 2025 13:54112,51667,485,85140,616,0001,015,0002,367,488
6Jun 21, 2025 13:54112,67075,371,10640,672,0001,016,0002,277,376
7Jun 21, 2025 13:54112,77069,496,01538,745,0002,980,0002,371,584
8Jun 21, 2025 13:54113,08966,953,41141,843,00002,277,376
9Jun 21, 2025 13:54113,09765,054,66439,854,0001,992,0002,371,584