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 28, 2026 21:07Victor MerckléVictor MerckléScore: 5,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 21:075,43954,889,80244,129,0001,019,0002,117,632stderr
2Aug 28, 2026 21:075,44454,202,23544,169,0001,021,0002,117,632stderr
3Aug 28, 2026 21:075,44754,296,50644,195,0001,019,0002,117,632stderr
4Aug 28, 2026 21:075,45454,320,29744,253,0001,018,0002,117,632stderr
5Aug 28, 2026 21:075,45754,343,63844,281,0001,017,0002,117,632stderr
6Aug 28, 2026 21:075,46854,405,78544,346,0001,040,0002,117,632stderr
7Aug 28, 2026 21:075,49053,765,31344,548,0001,022,0002,117,632stderr
8Aug 28, 2026 21:075,52454,962,23044,818,0001,032,0002,117,632stderr
9Aug 28, 2026 21:075,52554,907,60944,829,0001,032,0002,117,632stderr