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 21, 2026 16:42izotoffizotoffScore: 115,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:42115,28473,195,61041,640,0001,015,0002,334,720
2Mar 21, 2026 16:42115,79280,622,33040,851,0001,992,0002,387,968
3Mar 21, 2026 16:42116,47869,382,08140,091,0003,006,0002,387,968