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 listJul 7, 2026 19:32Victor MerckléVictor MerckléScore: 57,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:3356,82929,256,61320,022,0001,005,0002,117,632stderr
2Jul 7, 2026 19:3356,87529,091,98920,017,0001,027,0002,117,632stderr
3Jul 7, 2026 19:3356,91329,124,50220,009,0001,049,0002,117,632stderr
4Jul 7, 2026 19:3356,94828,898,11920,057,0001,014,0002,117,632stderr
5Jul 7, 2026 19:3357,02929,122,70020,076,0001,025,0002,117,632stderr
6Jul 7, 2026 19:3357,12929,209,27420,113,0001,025,0002,117,632stderr
7Jul 7, 2026 19:3357,12929,187,89920,123,0001,015,0002,117,632stderr
8Jul 7, 2026 19:3357,13228,907,47420,088,0001,051,0002,117,632stderr
9Jul 7, 2026 19:33144,32961,179,92553,402,00002,117,632stderr