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 11, 2025 17:24Chandrasekaran AkashChandrasekaran AkashScore: 7,300,784Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 17:437,231,2862,701,874,2452,674,577,000999,0002,445,312
2Apr 11, 2025 17:437,234,1462,707,995,4912,674,636,0001,998,0002,449,408
3Apr 11, 2025 17:247,299,7032,724,860,9522,699,891,000999,0002,269,184
4Apr 11, 2025 17:247,300,7842,729,944,8952,701,290,00002,445,312
5Apr 11, 2025 17:247,755,4352,893,606,1192,868,512,000999,0002,269,184
6Apr 11, 2025 17:437,866,7242,939,285,2822,910,688,00002,269,184