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 listJul 1, 2026 13:24IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 13:250117,277,444106,594,0001,109,0002,113,536expected "429496489001 ", got "429496729500 "
2Jul 1, 2026 13:250111,572,870100,847,0001,173,0002,113,536expected "429496508872 ", got "429496729500 "
3Jul 1, 2026 13:250117,214,910106,058,0001,185,0002,113,536expected "429496476617 ", got "429496729413 "