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 17:11IlyaIlyaError
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 17:13035,298,21024,650,0001,127,0002,113,536expected "429496523815 ", got "429496519503 "
2Jun 30, 2026 17:1369,58635,233,21024,556,0001,191,0002,113,536
3Jun 30, 2026 17:1369,95435,794,99424,662,0001,221,0002,113,536
4Jun 30, 2026 17:1370,15635,898,02924,740,0001,218,0002,113,536
5Jun 30, 2026 17:1320,941,1277,758,282,0757,590,772,000157,445,0002,113,536
6Jun 30, 2026 17:1321,034,4457,793,354,8737,626,589,000156,156,0002,113,536
7Jun 30, 2026 17:1321,039,5327,794,614,8517,627,826,000156,801,0002,113,536
8Jun 30, 2026 17:1321,047,9057,797,521,0357,629,759,000157,966,0002,113,536
9Jun 30, 2026 17:1321,170,1947,843,004,1537,678,617,000154,355,0002,113,536