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 13:31IlyaIlyaError
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 13:31032,064,02721,405,0001,101,0002,113,536expected "429496481322 ", got "429496485463 "
2Jul 3, 2026 13:3160,83232,098,57421,403,0001,105,0002,113,536
3Jul 3, 2026 13:3161,12432,174,48121,464,0001,152,0002,113,536