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 17:24Victor MerckléVictor MerckléScore: 76,194Success
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 17:2875,013631,190,733205,924,000416,687,0002,117,632stderr
2Sep 8, 2026 17:2875,128632,360,821206,521,000417,046,00024,576stderr
3Sep 8, 2026 17:2875,224632,969,443206,903,000417,458,00024,576stderr
4Sep 8, 2026 17:2875,757637,300,675207,435,000421,356,00024,576stderr
5Sep 8, 2026 17:2876,194641,019,570208,481,000423,932,0002,117,632stderr
6Sep 8, 2026 17:2876,448643,800,971207,341,000427,181,0002,117,632stderr
7Sep 8, 2026 17:2876,529644,341,474208,900,000426,298,0002,117,632stderr
8Sep 8, 2026 17:2876,584644,155,164209,386,000426,264,0002,117,632stderr
9Sep 8, 2026 17:2877,193649,305,438209,055,000431,649,0002,117,632stderr