Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 14, 2026 15:26highload-churnerhighload-churnerScore: 3,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 15:263,18335,776,47526,427,000020,480
2Oct 14, 2026 15:263,18335,997,34726,427,000020,480
3Oct 14, 2026 15:263,18535,988,74526,443,000020,480
4Oct 14, 2026 15:263,18836,083,29026,463,000020,480
5Oct 14, 2026 15:263,19236,043,70626,497,000020,480
6Oct 14, 2026 15:263,19436,091,07726,518,000020,480
7Oct 14, 2026 15:263,19936,117,24126,553,000020,480
8Oct 14, 2026 15:263,20235,584,05926,580,000020,480
9Oct 14, 2026 15:263,20736,192,88326,620,000020,480