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 18, 2025 16:39emily graceemily graceScore: 72,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 16:3972,13551,213,68825,664,0001,026,0002,289,664
2Apr 18, 2025 16:3972,53053,403,00725,843,000993,0002,289,664
3Apr 18, 2025 16:3972,57356,373,58225,858,000994,0002,273,280
4Apr 18, 2025 16:3972,57355,838,82724,863,0001,989,0002,289,664
5Apr 18, 2025 16:3972,63550,881,70324,885,0001,990,0002,277,376
6Apr 18, 2025 16:3972,70052,417,33425,903,000996,0002,281,472
7Apr 18, 2025 16:3972,71151,716,45025,907,000996,0002,289,664
8Apr 18, 2025 16:3972,88649,649,39624,971,0001,997,0002,289,664
9Apr 18, 2025 16:3973,02249,794,99825,017,0002,001,0002,277,376