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 3, 2026 09:40IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 09:41058,449,22247,779,0001,170,0002,113,536expected "429496536682 ", got "429496545655 "
2Jul 3, 2026 09:4162,70532,711,76722,060,0001,141,0002,113,536
3Jul 3, 2026 09:4162,70832,738,91922,021,0001,181,0002,113,536