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 12, 2026 05:31Victor MerckléVictor MerckléScore: 3,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 05:323,81240,068,36930,587,0001,054,0002,117,632stderr
2Aug 12, 2026 05:323,81940,118,40130,598,0001,102,0002,117,632stderr
3Aug 12, 2026 05:323,82640,192,60530,663,0001,099,0002,117,632stderr
4Aug 12, 2026 05:323,82940,198,19430,699,0001,082,0002,117,632stderr
5Aug 12, 2026 05:323,83440,183,24130,755,0001,069,0002,117,632stderr
6Aug 12, 2026 05:323,84341,214,33730,810,0001,089,0002,117,632stderr
7Aug 12, 2026 05:323,87540,579,92831,121,0001,048,0002,117,632stderr
8Aug 12, 2026 05:323,87640,593,75831,040,0001,139,0002,117,632stderr
9Aug 12, 2026 05:324,06642,157,12332,670,0001,086,0002,117,632stderr