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 01:33Chandrasekaran AkashChandrasekaran AkashScore: 61,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 01:3361,79248,984,49520,875,0001,988,0002,441,216
2Apr 18, 2025 01:3361,81449,487,36021,877,000994,0002,269,184
3Apr 18, 2025 01:3362,25152,477,36422,032,0001,001,0002,269,184