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 21, 2025 05:35Steve BronderSteve BronderScore: 71,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 05:3571,66249,423,01925,496,0001,019,0002,531,328
2Apr 21, 2025 05:3571,79258,536,12725,542,0001,021,0002,519,040
3Apr 21, 2025 05:3572,05453,569,36426,660,00002,527,232