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 03:16Chandrasekaran AkashChandrasekaran AkashScore: 60,816Success
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 03:1660,38645,887,73921,328,0001,015,0002,269,184
2Apr 18, 2025 03:1660,81642,240,15722,502,00002,445,312
3Apr 18, 2025 03:1660,83243,520,21922,508,00002,531,328