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 23:00Victor MerckléVictor MerckléScore: 10,079Success
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 23:019,97491,198,89180,653,0002,136,0002,117,632stderr
2Aug 26, 2026 23:0110,00391,382,23180,832,0002,193,0002,117,632stderr
3Aug 26, 2026 23:0110,03192,301,25880,968,0002,292,0002,117,632stderr
4Aug 26, 2026 23:0110,06991,772,36681,553,0002,022,0002,117,632stderr
5Aug 26, 2026 23:0110,07992,025,47881,435,0002,221,0002,117,632stderr
6Aug 26, 2026 23:0110,10392,065,93281,683,0002,179,0002,117,632stderr
7Aug 26, 2026 23:0110,17692,887,35982,451,0002,018,0002,117,632stderr
8Aug 26, 2026 23:0110,57396,110,57785,514,0002,245,0002,117,632stderr
9Aug 26, 2026 23:0110,62696,545,86485,992,0002,211,0002,117,632stderr