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 25, 2026 02:22Victor MerckléVictor MerckléScore: 7,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 02:237,34669,325,86159,894,0001,086,0002,117,632stderr
2Aug 25, 2026 02:237,50870,708,45761,221,0001,100,0002,117,632stderr
3Aug 25, 2026 02:237,51370,761,29961,222,0001,138,0002,117,632stderr
4Aug 25, 2026 02:237,53170,967,66661,344,0001,169,0002,117,632stderr
5Aug 25, 2026 02:237,53270,932,95261,349,0001,173,0002,117,632stderr
6Aug 25, 2026 02:237,55671,091,72661,615,0001,101,0002,117,632stderr
7Aug 25, 2026 02:237,56971,202,06861,814,0001,009,0002,117,632stderr
8Aug 25, 2026 02:237,60571,475,55362,022,0001,101,0002,117,632stderr
9Aug 25, 2026 02:237,68772,200,41662,712,0001,092,0002,117,632stderr