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 11, 2025 00:54Chandrasekaran AkashChandrasekaran AkashScore: 7,599,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 00:547,474,8352,790,618,7342,763,691,0001,998,0002,453,504
2Apr 11, 2025 00:547,599,5572,837,820,1752,810,837,000999,0002,445,312
3Apr 11, 2025 00:547,871,4432,939,039,3882,911,435,000999,0002,269,184