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 14:54olliecrowolliecrowScore: 96,195Success
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 14:5495,97362,211,05033,538,0001,972,0002,277,376
2Mar 25, 2026 14:5496,19561,478,59935,592,00002,392,064
3Mar 25, 2026 14:5498,84164,464,22736,571,00002,277,376