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 listSep 12, 2026 09:27Haha ExpertHaha ExpertScore: 79,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 09:2878,57837,662,06828,062,0001,012,0002,117,632
2Sep 12, 2026 09:2878,82737,862,86328,150,0001,016,0002,117,632
3Sep 12, 2026 09:2878,92937,829,35128,183,0001,021,0002,117,632
4Sep 12, 2026 09:2879,18340,842,92228,259,0001,039,0002,117,632
5Sep 12, 2026 09:2879,27037,827,60228,276,0001,054,0002,117,632
6Sep 12, 2026 09:2879,29438,145,18728,306,0001,033,0002,117,632
7Sep 12, 2026 09:2879,49138,104,52028,371,0001,041,0002,117,632
8Sep 12, 2026 09:2879,56439,435,99828,408,0001,031,0002,117,632
9Sep 12, 2026 09:2879,61038,067,82928,419,0001,037,0002,117,632