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 listMay 16, 2026 13:57M-RochatM-RochatScore: 73,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 13:5873,45636,755,59425,903,0001,276,0002,113,536
2May 16, 2026 13:5873,71038,229,67026,249,0001,024,0002,113,536
3May 16, 2026 13:5873,75938,089,11126,003,0001,288,0002,113,536
4May 16, 2026 13:5873,79436,173,29626,272,0001,032,0002,113,536
5May 16, 2026 13:5873,85436,224,11326,285,0001,041,0002,113,536
6May 16, 2026 13:5873,89736,113,63026,317,0001,025,0002,113,536
7May 16, 2026 13:5874,05636,265,60626,127,0001,274,0002,113,536
8May 16, 2026 13:5874,19137,858,85526,417,0001,034,0002,113,536
9May 16, 2026 13:5874,25636,885,64426,442,0001,033,0002,113,536