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 4, 2023 20:14Yurkov AlekseyYurkov AlekseyError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2023 20:1400000Error: expected "429496470417 ", got "167503647715 "
2Apr 4, 2023 20:1400000Error: expected "429496454451 ", got "201863355380 "
3Apr 4, 2023 20:1500000Error: expected "429496478358 ", got "188978461360 "