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 04:49Chandrasekaran AkashChandrasekaran AkashScore: 7,152,792Success
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 04:496,985,3762,619,304,5232,583,590,000999,0002,441,216
2Apr 11, 2025 04:497,152,7922,676,082,9952,645,534,000999,0002,449,408
3Apr 11, 2025 04:497,234,3052,699,215,8372,675,694,000999,0002,531,328