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 listFeb 11, 2026 12:41Alex KentAlex KentScore: 501,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 12:41494,130208,721,09041,960,000140,868,0002,301,952
2Feb 11, 2026 12:41497,038211,065,48841,978,000141,926,0002,306,048
3Feb 11, 2026 12:41499,078213,099,42740,924,000143,735,0002,498,560
4Feb 11, 2026 12:41499,668206,966,71641,972,000142,905,0002,310,144
5Feb 11, 2026 12:41501,762209,230,87341,921,000143,731,0002,486,272
6Feb 11, 2026 12:41501,897211,525,53940,934,000144,768,0002,453,504
7Feb 11, 2026 12:41502,949207,678,63943,021,000143,070,0002,306,048
8Feb 11, 2026 12:41507,711216,085,01941,967,000145,886,0002,310,144
9Feb 11, 2026 12:41513,643214,104,72146,011,000144,037,0002,289,664