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 8, 2026 22:41IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 22:41031,759,10920,529,0001,166,0002,113,536expected "429496524229 ", got "429496584279 "
2Jul 8, 2026 22:41031,310,86820,455,0001,119,0002,113,536expected "429496491434 ", got "429496566311 "
3Jul 8, 2026 22:41031,269,05620,508,0001,098,0002,113,536expected "429496513366 ", got "429496600393 "