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 02:00Chandrasekaran AkashChandrasekaran AkashScore: 61,803Success
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 02:0061,79249,789,85021,869,000994,0002,437,120
2Apr 18, 2025 02:0061,80354,256,20522,867,00002,269,184
3Apr 18, 2025 02:0061,80851,043,57721,875,000994,0002,531,328