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 26, 2026 00:46Victor MerckléVictor MerckléScore: 8,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 00:478,44878,479,29269,099,0001,023,0002,117,632stderr
2Aug 26, 2026 00:478,45978,487,61969,104,0001,111,0002,117,632stderr
3Aug 26, 2026 00:478,46578,537,66069,226,0001,036,0002,117,632stderr
4Aug 26, 2026 00:478,51878,877,76269,691,0001,014,0002,117,632stderr
5Aug 26, 2026 00:478,55579,140,75469,987,0001,024,0002,117,632stderr
6Aug 26, 2026 00:478,58979,452,40870,216,0001,075,0002,117,632stderr
7Aug 26, 2026 00:478,58979,458,92270,175,0001,115,0002,117,632stderr
8Aug 26, 2026 00:478,63179,830,63070,584,0001,061,0002,117,632stderr
9Aug 26, 2026 00:478,63679,835,13870,576,0001,103,0002,117,632stderr