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 listJun 29, 2026 13:36IlyaIlyaScore: 61,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 13:3760,83732,000,45121,399,0001,111,0002,113,536
2Jun 29, 2026 13:3760,89732,042,26421,426,0001,106,0002,113,536
3Jun 29, 2026 13:3761,23232,592,09121,445,0001,211,0002,113,536
4Jun 29, 2026 13:3761,28132,583,04721,459,0001,215,0002,113,536
5Jun 29, 2026 13:3761,31332,559,14621,481,0001,205,0002,113,536
6Jun 29, 2026 13:3761,36236,117,58021,495,0001,209,0002,113,536
7Jun 29, 2026 13:3761,47232,681,23721,503,0001,242,0002,113,536
8Jun 29, 2026 13:3761,47232,619,70221,543,0001,202,0002,113,536
9Jun 29, 2026 13:3761,54032,692,82921,538,0001,232,0002,113,536