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 19:05Elijah KinElijah KinScore: 227,451Success
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 19:05224,838106,285,84441,094,00042,096,0002,363,392
2Mar 15, 2026 19:05225,230105,601,67937,149,00046,186,0002,273,280
3Mar 15, 2026 19:05225,238107,676,36443,175,00040,163,0002,359,296
4Mar 15, 2026 19:05225,984114,084,28836,266,00047,348,0002,359,296
5Mar 15, 2026 19:05227,451108,248,90740,075,00044,082,0002,355,200
6Mar 15, 2026 19:05227,573109,061,04140,096,00044,106,0002,273,280
7Mar 15, 2026 19:05227,643109,389,03349,133,00035,095,0002,359,296
8Mar 15, 2026 19:05228,216107,326,16838,199,00046,241,0002,273,280
9Mar 15, 2026 19:05228,892112,276,71034,279,00050,411,0002,351,104