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 listNov 9, 2025 16:05Yehor BondarYehor BondarScore: 574,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2025 16:05569,597239,251,69035,957,000174,794,0002,510,848
2Nov 9, 2025 16:05570,016235,683,10834,984,000175,922,0002,510,848
3Nov 9, 2025 16:05571,614236,069,21735,914,000175,583,0002,277,376
4Nov 9, 2025 16:05572,565234,569,80034,975,000176,874,0002,306,048
5Nov 9, 2025 16:05574,303238,915,49034,916,000177,576,0002,359,296
6Nov 9, 2025 16:05574,368235,044,97134,920,000177,596,0002,293,760
7Nov 9, 2025 16:05575,100235,094,45034,965,000177,822,0002,297,856
8Nov 9, 2025 16:05575,676239,692,29035,000,000178,000,0002,293,760
9Nov 9, 2025 16:05577,503235,756,92134,947,000178,729,0002,297,856