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:15Chandrasekaran AkashChandrasekaran AkashScore: 62,019Success
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:1161,03046,479,85322,581,00002,531,328
2Apr 18, 2025 03:1161,33553,042,11322,694,00002,449,408
3Apr 18, 2025 03:1161,37849,592,69820,736,0001,974,0002,453,504
4Apr 18, 2025 03:1461,90343,105,47621,909,000995,0002,437,120
5Apr 18, 2025 03:1462,01947,135,41021,950,000997,0002,449,408
6Apr 18, 2025 03:1462,13050,184,03821,989,000999,0002,531,328
7Apr 18, 2025 03:1567,18454,456,79323,864,000994,0002,441,216
8Apr 18, 2025 03:1567,18948,569,33223,866,000994,0002,269,184
9Apr 18, 2025 03:1567,55449,716,53223,996,000999,0002,531,328