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 25, 2026 15:01olliecrowolliecrowScore: 97,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 15:0197,18667,640,38233,962,0001,997,0002,277,376
2Mar 25, 2026 15:0197,76262,839,64734,163,0002,009,0002,277,376
3Mar 25, 2026 15:0197,88958,140,02734,207,0002,012,0002,400,256