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 listAug 14, 2026 13:31marko1597marko1597Score: 153,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 13:33152,7321,277,996,5211,266,616,0001,063,0002,117,632stderr
2Aug 14, 2026 13:33153,0081,280,542,9701,268,881,0001,089,0002,117,632stderr
3Aug 14, 2026 13:33153,2171,281,587,1611,270,613,0001,089,0002,117,632stderr
4Aug 14, 2026 13:33153,5661,284,735,6601,273,593,0001,012,0002,117,632stderr
5Aug 14, 2026 13:33153,5841,284,670,6221,273,636,0001,119,0002,117,632stderr
6Aug 14, 2026 13:33153,6661,285,352,0191,274,260,0001,175,0002,117,632stderr
7Aug 14, 2026 13:33153,8421,287,516,6431,275,772,0001,120,0002,117,632stderr
8Aug 14, 2026 13:33153,9121,287,331,4621,276,402,0001,071,0002,117,632stderr
9Aug 14, 2026 13:33154,0091,288,347,7471,277,055,0001,225,0002,117,632stderr