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 19, 2025 06:54Ian MckibbenIan MckibbenScore: 75,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 06:5475,39751,079,90826,901,000996,0002,531,328
2Jan 19, 2025 06:5475,41152,026,26926,906,000996,0002,433,024
3Jan 19, 2025 06:5475,43050,209,21125,916,0001,993,0002,531,328
4Jan 19, 2025 06:5475,50048,827,55926,938,000997,0002,510,848
5Jan 19, 2025 06:5475,51149,306,87826,942,000997,0002,269,184
6Jan 19, 2025 06:5475,51652,833,33925,946,0001,995,0002,433,024
7Jan 19, 2025 06:5475,87852,101,26227,073,0001,002,0002,531,328
8Jan 19, 2025 06:5475,88947,432,17727,077,0001,002,0002,510,848
9Jan 19, 2025 06:5475,97052,906,24526,102,0002,007,0002,428,928