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:23Yuriy LyfenkoYuriy LyfenkoScore: 59,497Success
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:2359,197544,046,66919,912,0001,991,0002,441,216
2Apr 14, 2025 12:2359,497543,998,03520,013,0002,001,0002,527,232
3Apr 14, 2025 12:2359,549544,302,91120,030,0002,003,0002,527,232