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:35Victor MerckléVictor MerckléScore: 56,383Success
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:3656,22129,813,65119,781,0001,021,0002,121,728stderr
2Aug 31, 2026 12:3656,28929,917,63219,786,0001,041,0002,121,728stderr
3Aug 31, 2026 12:3656,35430,015,95519,800,0001,051,0002,121,728stderr
4Aug 31, 2026 12:3656,35929,919,33219,810,0001,043,0002,121,728stderr
5Aug 31, 2026 12:3656,38329,156,90819,826,0001,036,0002,121,728stderr
6Aug 31, 2026 12:3656,49129,952,73919,872,0001,030,0002,121,728stderr
7Aug 31, 2026 12:3656,50029,129,52819,865,0001,040,0002,121,728stderr
8Aug 31, 2026 12:3656,53229,985,23319,869,0001,048,0002,121,728stderr
9Aug 31, 2026 12:3656,90230,158,45619,994,0001,060,0002,121,728stderr