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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 22:00047,742,17420,569,00017,494,0002,113,536expected "429496469525 ", got "429496468441 "
2Jul 12, 2026 22:00100,95146,993,10320,475,00016,877,0002,113,536
3Jul 12, 2026 22:00101,34047,181,41020,512,00016,984,0002,113,536