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 01:14Chandrasekaran AkashChandrasekaran AkashScore: 62,111Success
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 01:1462,08147,112,61121,972,000998,0002,531,328
2Apr 18, 2025 01:1462,11144,663,07021,982,000999,0002,531,328
3Apr 18, 2025 01:1462,41650,939,67721,086,0002,008,0002,445,312