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 16, 2026 21:31Victor MerckléVictor MerckléScore: 3,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 21:323,46540,234,88827,721,0001,046,0002,117,632stderr
2Sep 16, 2026 21:323,47138,669,84527,742,0001,072,0002,117,632stderr
3Sep 16, 2026 21:323,48638,774,72527,897,0001,039,0002,117,632stderr
4Sep 16, 2026 21:323,48938,821,11327,913,0001,052,0002,117,632stderr
5Sep 16, 2026 21:323,54139,236,99628,356,0001,039,0002,117,632stderr
6Sep 16, 2026 21:323,59339,715,83028,781,0001,047,0002,117,632stderr
7Sep 16, 2026 21:323,65440,181,71429,281,0001,048,0002,117,632stderr
8Sep 16, 2026 21:323,66840,319,18729,366,0001,080,0002,117,632stderr
9Sep 16, 2026 21:323,67541,082,49729,443,0001,064,0002,117,632stderr