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 11, 2025 15:02Chandrasekaran AkashChandrasekaran AkashScore: 7,327,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 15:027,121,0032,660,830,1402,633,772,000999,0002,269,184
2Apr 11, 2025 15:027,327,5492,739,389,6732,710,195,000998,0002,445,312
3Apr 11, 2025 15:027,365,6242,756,302,7752,724,282,000999,0002,445,312