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 listAug 31, 2026 12:17Victor MerckléVictor MerckléScore: 63,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:2062,97531,385,48522,269,0001,032,0002,117,632stderr
2Aug 31, 2026 12:2063,06432,416,43222,276,0001,058,0002,117,632stderr
3Aug 31, 2026 12:2063,12431,516,29722,311,0001,045,0002,117,632stderr
4Aug 31, 2026 12:2063,18132,449,34222,326,0001,051,0002,117,632stderr
5Aug 31, 2026 12:2063,19732,479,74922,300,0001,083,0002,117,632stderr
6Aug 31, 2026 12:2063,24531,622,99322,354,0001,047,0002,117,632stderr
7Aug 31, 2026 12:2063,33733,264,78622,390,0001,045,0002,117,632stderr
8Aug 31, 2026 12:2063,44031,821,02622,363,0001,110,0002,117,632stderr
9Aug 31, 2026 12:2063,45432,535,54022,438,0001,040,0002,117,632stderr