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 11:13Alex KentAlex KentScore: 21,583,989Success
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 11:1321,450,9357,968,572,9907,729,008,000207,838,0002,306,048
2Feb 11, 2026 11:1321,520,3037,993,305,4857,766,647,000195,865,0002,494,464
3Feb 11, 2026 11:1321,533,4357,998,796,1827,767,513,000199,858,0002,519,040
4Feb 11, 2026 11:1321,561,2198,011,749,5347,773,814,000203,837,0002,281,472
5Feb 11, 2026 11:1321,583,9898,020,655,5567,787,224,000198,852,0002,281,472
6Feb 11, 2026 11:1321,591,4498,022,506,9587,775,001,000213,835,0002,281,472
7Feb 11, 2026 11:1321,619,0658,038,152,8057,795,206,000203,848,0002,281,472
8Feb 11, 2026 11:1321,634,3008,035,834,4617,794,857,000209,834,0002,281,472
9Feb 11, 2026 11:1321,661,0958,050,585,7437,806,745,000207,860,0002,301,952