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 04:42Chandrasekaran AkashChandrasekaran AkashScore: 62,484Success
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 04:4262,13249,426,89320,990,0001,999,0002,531,328
2Apr 18, 2025 00:3362,28646,044,91822,044,0001,002,0002,445,312
3Apr 18, 2025 00:3362,30346,859,49722,050,0001,002,0002,445,312
4Apr 14, 2025 04:4262,48443,487,37622,114,0001,005,0002,527,232
5Apr 18, 2025 00:3362,48444,729,51321,109,0002,010,0002,269,184
6Apr 14, 2025 04:4262,54344,657,54322,135,0001,006,0002,531,328