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 16:59Chandrasekaran AkashChandrasekaran AkashScore: 72,565Success
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 16:5972,56253,580,52324,860,0001,988,0002,449,408
2Apr 11, 2025 16:5972,56557,240,66724,861,0001,988,0002,269,184
3Apr 11, 2025 16:5972,59557,890,74724,871,0001,989,0002,269,184