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 12, 2025 07:19Oleg KovalovOleg KovalovScore: 137,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2025 07:19136,79581,645,44750,614,00002,457,600
2Mar 12, 2025 07:19136,92278,287,56948,635,0002,026,0002,461,696
3Mar 12, 2025 07:19136,94382,011,09649,656,0001,013,0002,469,888
4Mar 12, 2025 07:19137,29277,665,90246,814,0003,984,0002,449,408
5Mar 12, 2025 07:19137,47374,808,43049,848,0001,017,0002,330,624
6Mar 12, 2025 07:19137,53875,001,70848,854,0002,035,0002,461,696
7Mar 12, 2025 07:19137,64979,461,18947,935,0002,995,0002,465,792
8Mar 12, 2025 07:19137,85777,433,94848,007,0003,000,0002,539,520
9Mar 12, 2025 07:19138,27377,810,17949,155,0002,006,0002,330,624