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 9, 2025 16:55NoSIMD_C#NoSIMD_C#Score: 272,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 16:55270,438126,054,67053,033,00047,029,0002,523,136
2Apr 9, 2025 16:55272,476127,639,57460,889,00039,927,0002,293,760
3Apr 9, 2025 16:55274,095129,233,55162,255,00039,160,0002,293,760