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 08:18olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:08Yuriy Lyfenko85.54CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:09014,689,4990974,000405,504Exit with code 1:
2Mar 13, 2026 08:181,08128,974,5667,978,000997,0002,371,584
3Mar 13, 2026 08:181,08225,771,7537,982,000997,0002,531,328
4Mar 13, 2026 08:181,08225,929,0367,984,000998,0002,269,184
5Mar 13, 2026 08:181,08220,094,8726,986,0001,996,0002,273,280
6Mar 13, 2026 08:181,08527,077,0188,002,0001,000,0002,383,872
7Mar 13, 2026 08:181,08526,731,5418,005,0001,000,0002,273,280
8Mar 13, 2026 08:181,08825,876,4498,031,0001,003,0002,371,584
9Mar 13, 2026 08:181,08924,914,8698,034,0001,004,0002,379,776
10Mar 13, 2026 08:181,08921,197,7128,035,0001,004,0002,273,280