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 listFeb 10, 2026 14:21MMisMMisScore: 588,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 14:21583,878241,742,45135,005,000181,030,0002,453,504
2Feb 10, 2026 14:21584,208246,754,72236,026,000180,131,0002,502,656
3Feb 10, 2026 14:21587,676245,203,00435,907,000181,533,0002,293,760
4Feb 10, 2026 14:21587,892244,227,65335,920,000181,600,0002,314,240
5Feb 10, 2026 14:21588,157243,027,39236,935,000180,683,0002,408,448
6Feb 10, 2026 14:21588,603246,323,02435,964,000181,819,0002,400,256
7Feb 10, 2026 14:21594,122240,584,13635,971,000183,854,0002,277,376
8Feb 10, 2026 14:21595,605246,889,23435,898,000184,476,0002,396,160
9Feb 10, 2026 14:21599,422247,730,09635,965,000185,821,0002,527,232