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 11:37Victor MerckléVictor MerckléScore: 7,332Success
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 11:387,23368,435,20858,996,0001,041,0002,117,632stderr
2Aug 25, 2026 11:387,27168,824,70359,301,0001,051,0002,117,632stderr
3Aug 25, 2026 11:387,27468,791,38259,329,0001,048,0002,117,632stderr
4Aug 25, 2026 11:387,31969,168,77259,732,0001,016,0002,117,632stderr
5Aug 25, 2026 11:387,33269,319,57859,816,0001,044,0002,117,632stderr
6Aug 25, 2026 11:387,35569,395,55759,889,0001,158,0002,117,632stderr
7Aug 25, 2026 11:387,36969,560,08160,162,0001,006,0002,117,632stderr
8Aug 25, 2026 11:387,38569,747,36060,248,0001,051,0002,117,632stderr
9Aug 25, 2026 11:387,53170,785,92061,471,0001,044,0002,117,632stderr