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 14, 2025 12:38Yuriy LyfenkoYuriy LyfenkoScore: 60,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 12:3860,068548,117,05120,205,0002,020,0002,437,120
2Apr 14, 2025 12:3860,173546,962,96720,240,0002,024,0002,527,232
3Apr 14, 2025 12:3860,424546,105,71221,341,0001,016,0002,527,232