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 11, 2025 20:49Yuriy LyfenkoYuriy LyfenkoScore: 59,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 20:4959,64643,923,42820,063,0002,006,0002,441,216
2Apr 11, 2025 20:4959,85944,231,58121,142,0001,006,0002,433,024
3Apr 11, 2025 20:4960,17844,068,80520,242,0002,024,0002,437,120