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 listSep 17, 2026 16:17Victor MerckléVictor MerckléScore: 4,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 16:314,07343,643,87932,720,0001,092,0002,117,632stderr
2Sep 17, 2026 16:314,08244,300,87032,806,0001,079,0002,117,632stderr
3Sep 17, 2026 16:314,12844,686,66533,194,0001,076,0002,117,632stderr
4Sep 17, 2026 16:314,13244,452,44433,228,0001,071,0002,117,632stderr
5Sep 17, 2026 16:314,15544,869,09033,408,0001,086,0002,117,632stderr
6Sep 17, 2026 16:314,16445,730,69233,486,0001,079,0002,117,632stderr
7Sep 17, 2026 16:314,17444,470,64233,565,0001,084,0002,117,632stderr
8Sep 17, 2026 16:314,18745,164,85033,718,0001,037,0002,117,632stderr
9Sep 17, 2026 16:314,18945,247,50033,756,0001,016,0002,117,632stderr