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 09:54IlyaIlyaError
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 09:54031,769,78720,980,0001,205,0002,113,536expected "429496529772 ", got "429496359215 "
2Jun 30, 2026 09:54032,119,63020,940,0001,199,0002,113,536expected "429496508292 ", got "429496303311 "
3Jun 30, 2026 09:5421,270,0057,879,948,5467,712,656,000157,246,0002,113,536