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 16:48emily 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 16:4800000Error: expected "429496473741 ", got "369366997996 "
2Apr 18, 2025 16:4900000Error: expected "429496504625 ", got "416611616050 "
3Apr 18, 2025 16:4900000Error: expected "429496498279 ", got "408021684258 "
4Apr 18, 2025 16:5000000Error: expected "429496456187 ", got "356482094974 "