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 16:00IlyaIlyaError
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 16:02033,273,76221,129,0001,184,0002,113,536expected "429496504623 ", got "429496498904 "
2Jun 30, 2026 16:0260,43532,371,55521,123,0001,238,0002,113,536
3Jun 30, 2026 16:0260,89132,396,59921,331,0001,199,0002,113,536
4Jun 30, 2026 16:0221,064,1107,803,503,5817,637,828,000155,893,0002,113,536
5Jun 30, 2026 16:0221,065,8947,804,306,0677,639,307,000155,074,0002,113,536
6Jun 30, 2026 16:0221,067,4707,805,445,0957,639,120,000155,844,0002,113,536
7Jun 30, 2026 16:0221,088,1947,812,771,3697,646,690,000155,942,0002,113,536
8Jun 30, 2026 16:0221,121,6567,825,276,6537,654,865,000160,148,0002,113,536
9Jun 30, 2026 16:0221,123,0277,825,631,6937,656,924,000158,596,0002,113,536