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 listMar 16, 2026 22:48izotoffizotoffScore: 123,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:48123,12269,176,90744,543,0001,012,0002,318,336
2Mar 16, 2026 22:48123,23571,610,21444,584,0001,013,0002,387,968
3Mar 16, 2026 22:48123,82775,771,16644,820,000996,0002,314,240