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 19:22emily graceemily graceError
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 19:2200000Error: expected "429496557749 ", got "412316577253 "
2Apr 18, 2025 19:2200000Error: expected "429496482198 ", got "412316531727 "
3Apr 18, 2025 19:2300000Error: expected "429496494137 ", got "412316576353 "