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 listApr 16, 2026 16:10olliecrowolliecrowScore: 536,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 16:10534,635224,961,49122,978,000174,837,0002,351,104
2Apr 16, 2026 16:10536,511223,913,77222,943,000175,566,0002,502,656
3Apr 16, 2026 16:10559,208233,117,19321,990,000184,917,0002,420,736