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 10, 2026 14:12Victor MerckléVictor MerckléScore: 4,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 14:134,27643,701,98534,332,0001,164,0002,117,632stderr
2Aug 10, 2026 14:134,28243,748,27934,432,0001,109,0002,117,632stderr
3Aug 10, 2026 14:134,28443,736,91534,433,0001,129,0002,117,632stderr
4Aug 10, 2026 14:134,29143,790,59434,523,0001,098,0002,117,632stderr
5Aug 10, 2026 14:134,30344,133,07134,621,0001,101,0002,117,632stderr
6Aug 10, 2026 14:134,30344,141,86734,657,0001,058,0002,117,632stderr
7Aug 10, 2026 14:134,32144,018,90434,830,0001,042,0002,117,632stderr
8Aug 10, 2026 14:134,32644,108,98834,810,0001,104,0002,117,632stderr
9Aug 10, 2026 14:134,42344,887,59035,587,0001,125,0002,117,632stderr