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 24, 2026 21:25Victor MerckléVictor MerckléScore: 3,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 21:263,86640,492,29630,896,0001,195,0002,117,632stderr
2Aug 24, 2026 21:263,86940,504,62331,044,0001,070,0002,117,632stderr
3Aug 24, 2026 21:263,87040,537,91730,978,0001,150,0002,117,632stderr
4Aug 24, 2026 21:263,87240,468,79530,987,0001,152,0002,117,632stderr
5Aug 24, 2026 21:263,87240,590,98931,103,0001,041,0002,117,632stderr
6Aug 24, 2026 21:263,87640,511,78631,136,0001,038,0002,117,632stderr
7Aug 24, 2026 21:263,89940,745,74631,221,0001,145,0002,117,632stderr
8Aug 24, 2026 21:263,90141,579,74531,344,0001,040,0002,117,632stderr
9Aug 24, 2026 21:263,92541,038,92731,388,0001,194,0002,117,632stderr