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 listOct 11, 2025 19:41Aleksei ShahoikaAleksei ShahoikaScore: 85,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 19:4184,90553,516,71130,402,0001,013,0002,269,184
2Oct 11, 2025 19:4185,31150,854,64630,547,0001,018,0002,285,568
3Oct 11, 2025 19:4186,03258,908,71729,843,0001,989,0002,285,568