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:48Chandrasekaran AkashChandrasekaran AkashScore: 60,814Success
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:4860,56548,119,41822,409,00002,531,328
2Apr 18, 2025 03:4860,65945,041,47921,424,0001,020,0002,453,504
3Apr 18, 2025 03:4860,79242,754,31622,493,00002,531,328
4Apr 18, 2025 03:4860,81142,995,46021,478,0001,022,0002,269,184
5Apr 18, 2025 03:4860,81444,644,75222,501,00002,449,408
6Apr 18, 2025 03:4860,85743,907,54822,517,00002,441,216
7Apr 18, 2025 03:4860,98153,793,11722,563,00002,449,408
8Apr 18, 2025 03:4861,02246,981,84921,552,0001,026,0002,531,328
9Apr 18, 2025 03:4861,02754,802,89022,580,00002,531,328