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 listMar 13, 2026 04:05olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:12Yuriy Lyfenko46.56CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:12015,832,42601,000,000409,600Exit with code 1:
2Mar 13, 2026 04:052,08943,846,90917,342,00002,506,752
3Mar 13, 2026 04:052,09042,685,47717,343,00002,506,752
4Mar 13, 2026 04:052,09141,805,21117,353,00002,502,656
5Mar 13, 2026 04:052,09143,338,75117,354,00002,273,280
6Mar 13, 2026 04:052,09341,020,61517,373,00002,502,656
7Mar 13, 2026 04:052,09541,631,34417,389,00002,273,280
8Mar 13, 2026 04:052,10740,183,74917,492,00002,273,280
9Mar 13, 2026 04:052,10937,863,92417,504,00002,506,752
10Mar 13, 2026 04:052,11142,505,04917,518,00002,273,280