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 26, 2026 21:12IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 21:16032,951,33122,557,0001,114,0002,113,536expected "429496516800 ", got "429496516993 "
2Jun 26, 2026 21:16033,272,21422,562,0001,194,0002,113,536expected "429496541957 ", got "429496542077 "
3Jun 26, 2026 21:1663,64332,836,69722,426,0001,122,0002,113,536
4Jun 26, 2026 21:1663,82932,884,71922,416,0001,201,0002,113,536
5Jun 26, 2026 21:1663,85633,326,91022,403,0001,224,0002,113,536
6Jun 26, 2026 21:1664,05933,355,44722,464,0001,238,0002,113,536
7Jun 26, 2026 21:1664,14032,936,64322,702,0001,030,0002,113,536
8Jun 26, 2026 21:1664,20033,007,15722,644,0001,110,0002,113,536
9Jun 26, 2026 21:1664,42433,556,98722,595,0001,242,0002,113,536