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 4, 2026 05:35olliecrowolliecrowScore: 69,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 05:3569,82750,662,91523,849,0001,987,0002,277,376
2Mar 4, 2026 05:3569,93852,390,46725,877,00002,400,256
3Mar 4, 2026 05:3570,07358,055,45224,930,000997,0002,277,376