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 17:23IlyaIlyaError
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 17:2408,119,499,5527,946,097,000163,408,0002,113,536expected "429496512379 ", got "433791263282 "
2Jun 25, 2026 17:2408,187,344,1608,009,586,000167,894,0002,113,536expected "429496485544 ", got "433791214777 "
3Jun 25, 2026 17:24037,932,66027,126,0001,194,0002,113,536expected "429496544445 ", got "4294782141 "