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 27, 2026 14:46Victor MerckléVictor MerckléScore: 3,112,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 14:473,111,4351,169,612,4171,149,233,0001,998,0002,326,528stderr
2Apr 27, 2026 14:473,112,1451,173,948,6181,149,495,0001,999,0002,322,432stderr
3Apr 27, 2026 14:473,112,2131,173,896,1701,149,520,0001,999,0002,519,040stderr