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 listMar 6, 2026 10:54olliecrowolliecrowScore: 62,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 10:5462,35145,371,28821,064,0002,006,0002,289,664
2Mar 6, 2026 10:5462,42753,982,49821,090,0002,008,0002,531,328
3Mar 6, 2026 10:5462,91945,734,25321,256,0002,024,0002,273,280