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 06:20MMisMMisScore: 593,289Success
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 06:20583,724243,075,80434,996,000180,982,0002,269,184
2Feb 11, 2026 06:20585,003247,735,42235,909,000180,542,0002,281,472
3Feb 11, 2026 06:20585,662240,021,75833,952,000182,743,0002,273,280
4Feb 11, 2026 06:20591,476248,986,72334,975,000183,871,0002,527,232
5Feb 11, 2026 06:20593,289246,926,68536,918,000182,599,0002,277,376
6Feb 11, 2026 06:20597,251248,292,30533,997,000186,986,0002,461,696
7Feb 11, 2026 06:20598,873250,207,87635,932,000185,651,0002,441,216
8Feb 11, 2026 06:20599,203248,148,90035,952,000185,753,0002,334,720
9Feb 11, 2026 06:20601,416249,148,75635,923,000186,601,0002,281,472