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 listMay 11, 2026 15:31Victor MerckléVictor MerckléScore: 67,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:3267,43234,895,03123,739,0001,211,0002,113,536
2May 11, 2026 15:3267,49435,790,88723,750,0001,223,0002,113,536
3May 11, 2026 15:3267,56433,762,22323,796,0001,203,0002,113,536
4May 11, 2026 15:3267,68333,802,95123,864,0001,179,0002,113,536
5May 11, 2026 15:3267,78634,111,76423,901,0001,180,0002,113,536
6May 11, 2026 15:3268,02133,986,09723,947,0001,221,0002,113,536
7May 11, 2026 15:3268,06233,859,31123,958,0001,225,0002,113,536
8May 11, 2026 15:3268,60834,191,27624,175,0001,210,0002,113,536
9May 11, 2026 15:32190,57079,246,12869,345,0001,166,0002,113,536