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 listJun 25, 2026 18:27IlyaIlyaScore: 76,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:2870,57235,828,47524,899,0001,213,0002,113,536
2Jun 25, 2026 18:2876,41337,561,27427,168,0001,105,0002,113,536
3Jun 25, 2026 18:2876,50837,510,12027,182,0001,126,0002,117,632
4Jun 25, 2026 18:2876,76438,107,99627,185,0001,218,0002,113,536
5Jun 25, 2026 18:2876,90037,937,21427,240,0001,213,0002,113,536
6Jun 25, 2026 18:2876,93238,193,21327,236,0001,229,0002,113,536
7Jun 25, 2026 18:2877,30238,293,91927,394,0001,208,0002,113,536
8Jun 25, 2026 18:2877,32138,283,67227,378,0001,231,0002,113,536
9Jun 25, 2026 18:2877,38138,320,28227,413,0001,218,0002,113,536