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 30, 2026 08:01IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 08:04031,405,27320,543,0001,208,0002,113,536expected "429496477947 ", got "429496323268 "
2Jun 30, 2026 08:04031,759,12220,641,0001,202,0002,113,536expected "429496482364 ", got "429496291965 "
3Jun 30, 2026 08:0420,859,3947,728,023,3607,561,838,000156,138,0002,113,536
4Jun 30, 2026 08:0420,899,4677,742,545,1627,574,322,000158,481,0002,113,536
5Jun 30, 2026 08:0420,910,6377,755,235,2757,579,180,000157,756,0002,113,536
6Jun 30, 2026 08:0421,021,7187,788,206,0147,620,428,000157,608,0002,113,536
7Jun 30, 2026 08:0421,024,7057,788,827,9937,622,559,000156,582,0002,113,536
8Jun 30, 2026 08:0421,051,4027,798,932,4747,632,681,000156,338,0002,113,536
9Jun 30, 2026 08:0421,125,7627,827,462,9687,660,887,000155,645,0002,113,536