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 20, 2025 15:34Drew GarciaDrew GarciaScore: 75,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2025 15:3475,22256,229,15625,844,0001,988,0002,281,472
2Apr 20, 2025 15:3475,23854,631,05425,850,0001,988,0002,277,376
3Apr 20, 2025 15:3475,24658,053,95926,847,000994,0002,281,472
4Apr 20, 2025 15:3475,24961,213,15124,859,0002,983,0002,281,472
5Apr 20, 2025 15:3475,25754,745,04424,862,0002,983,0002,277,376
6Apr 20, 2025 15:3475,27655,969,32724,868,0002,984,0002,281,472
7Apr 20, 2025 15:3475,51950,267,50925,947,0001,995,0002,269,184
8Apr 20, 2025 15:3475,83248,388,66624,050,0004,008,0002,277,376
9Apr 20, 2025 15:3475,99553,884,81325,106,0003,012,0002,277,376