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 07:27Emanuele BolognesiEmanuele BolognesiScore: 4,989,503Success
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 07:274,979,8163,125,028,7541,086,724,000755,808,0002,490,368
2Apr 18, 2025 07:274,989,5033,349,883,9811,081,523,000764,593,0002,379,776
3Apr 18, 2025 07:275,088,8573,470,141,6601,078,483,000804,394,0002,330,624