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 02:42Chandrasekaran AkashChandrasekaran AkashScore: 61,800Success
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 02:4261,77847,172,24621,865,000993,0002,531,328
2Apr 18, 2025 02:4261,80052,430,94421,872,000994,0002,441,216
3Apr 18, 2025 02:4261,81454,503,25021,877,000994,0002,269,184