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 20, 2026 16:31BenBenScore: 240,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:35239,891118,565,94245,876,00042,884,0002,465,792
2Apr 20, 2026 16:35240,602115,518,60143,011,00046,012,0002,457,600
3Apr 20, 2026 16:35241,375120,606,48344,153,00045,156,0002,465,792