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 14, 2025 03:48Chandrasekaran AkashChandrasekaran AkashScore: 8,338,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 03:488,315,3813,108,522,0753,076,691,00002,445,312
2Apr 14, 2025 03:488,338,1323,115,711,2163,084,110,000999,0002,269,184
3Apr 14, 2025 03:488,368,1703,125,679,8283,095,224,000999,0002,269,184