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 listSep 8, 2026 15:17Victor MerckléVictor MerckléScore: 17,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 15:2017,696155,863,513142,045,0004,837,00024,576stderr
2Sep 8, 2026 15:2017,856156,770,447143,296,0004,915,0002,117,632stderr
3Sep 8, 2026 15:2017,858157,356,705143,478,0004,748,00024,576stderr
4Sep 8, 2026 15:2017,872156,783,216143,575,0004,764,00024,576stderr
5Sep 8, 2026 15:2017,884156,965,127143,817,0004,623,00024,576stderr
6Sep 8, 2026 15:2017,892157,660,674143,626,0004,881,0002,117,632stderr
7Sep 8, 2026 15:2017,897157,683,019143,851,0004,701,00024,576stderr
8Sep 8, 2026 15:2017,907157,205,412143,605,0005,029,0002,117,632stderr
9Sep 8, 2026 15:2017,966157,663,678144,052,0005,067,0002,117,632stderr