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 listJan 25, 2025 00:56Ian MckibbenIan MckibbenScore: 69,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 00:5668,86253,814,83625,479,00002,531,328
2Jan 25, 2025 00:5668,91947,771,97525,500,00002,531,328
3Jan 25, 2025 00:5669,38449,144,66624,646,0001,026,0002,531,328
4Jan 25, 2025 00:5669,40052,880,48725,678,00002,437,120
5Jan 25, 2025 00:5669,46553,146,01525,702,00002,428,928
6Jan 25, 2025 00:5669,47055,479,51425,704,00002,531,328
7Jan 25, 2025 00:5669,87650,851,87924,860,000994,0002,433,024
8Jan 25, 2025 00:5669,87852,840,09424,861,000994,0002,531,328
9Jan 25, 2025 00:5669,88955,769,91925,859,00002,424,832