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 05:32Chandrasekaran AkashChandrasekaran AkashScore: 67,551Success
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 05:3164,50849,256,88522,874,000994,0002,531,328
2Apr 14, 2025 05:3164,64345,137,73422,922,000996,0002,531,328
3Apr 14, 2025 05:3164,81947,032,80622,984,000999,0002,449,408
4Apr 14, 2025 05:3267,55143,042,91022,995,0001,999,0002,527,232
5Apr 14, 2025 05:3267,68449,128,90524,042,0001,001,0002,531,328
6Apr 14, 2025 05:3267,75947,086,37523,066,0002,005,0002,449,408