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:28Victor MerckléVictor MerckléScore: 56,464Success
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:2956,26729,984,05919,783,0001,036,0002,117,632stderr
2Aug 31, 2026 12:2956,38629,565,07619,813,0001,050,0002,117,632stderr
3Aug 31, 2026 12:2956,41829,076,46319,842,0001,033,0002,117,632stderr
4Aug 31, 2026 12:2956,43729,198,13019,860,0001,022,0002,117,632stderr
5Aug 31, 2026 12:2956,46429,164,30319,874,0001,018,0002,117,632stderr
6Aug 31, 2026 12:2956,55629,963,77219,899,0001,027,0002,117,632stderr
7Aug 31, 2026 12:2956,61829,254,79819,914,0001,035,0002,117,632stderr
8Aug 31, 2026 12:29143,61861,998,17552,113,0001,026,0002,117,632stderr
9Aug 31, 2026 12:29144,97861,767,70852,601,0001,041,0002,117,632stderr