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 12:48Victor MerckléVictor MerckléScore: 4,309Success
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 12:494,28544,018,85034,458,0001,115,0002,117,632stderr
2Aug 12, 2026 12:494,29544,148,18534,517,0001,136,0002,117,632stderr
3Aug 12, 2026 12:494,29744,152,74534,555,0001,116,0002,117,632stderr
4Aug 12, 2026 12:494,29844,080,19134,546,0001,134,0002,117,632stderr
5Aug 12, 2026 12:494,30944,107,20434,689,0001,076,0002,117,632stderr
6Aug 12, 2026 12:494,31944,262,70534,715,0001,137,0002,117,632stderr
7Aug 12, 2026 12:494,34344,278,75034,863,0001,187,0002,117,632stderr
8Aug 12, 2026 12:494,36844,627,76935,181,0001,081,0002,117,632stderr
9Aug 12, 2026 12:494,53946,071,93736,661,0001,014,0002,117,632stderr