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 21, 2026 18:37Charles CabergsCharles CabergsScore: 70,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:3870,71645,088,31424,153,0002,012,0002,363,392
2Apr 21, 2026 18:3870,75439,230,10125,173,0001,006,0002,359,296
3Apr 21, 2026 18:3870,81341,390,07624,186,0002,015,0002,363,392
4Apr 21, 2026 18:3870,82144,338,06624,189,0002,015,0002,363,392
5Apr 21, 2026 18:3870,97843,319,55724,242,0002,020,0002,367,488
6Apr 21, 2026 18:3871,02746,813,65324,259,0002,021,0002,359,296
7Apr 21, 2026 18:3871,06247,914,39425,282,0001,011,0002,355,200
8Apr 21, 2026 18:3871,07547,379,11725,287,0001,011,0002,363,392
9Apr 21, 2026 18:3871,12442,634,57725,304,0001,012,0002,363,392