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 11, 2026 21:31Victor MerckléVictor MerckléScore: 3,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 21:343,45938,466,97227,586,0001,124,0002,117,632stderr
2Sep 11, 2026 21:343,46038,511,99727,609,0001,111,0002,117,632stderr
3Sep 11, 2026 21:343,46238,744,11727,598,0001,143,0002,117,632stderr
4Sep 11, 2026 21:343,52538,800,52828,252,0001,012,0002,117,632stderr
5Sep 11, 2026 21:343,52839,722,19128,163,0001,124,0002,117,632stderr
6Sep 11, 2026 21:343,53339,133,86728,181,0001,150,0002,117,632stderr
7Sep 11, 2026 21:343,54940,091,63628,307,0001,151,0002,117,632stderr
8Sep 11, 2026 21:343,56339,335,41728,445,0001,136,0002,117,632stderr
9Sep 11, 2026 21:343,57739,491,36428,579,0001,118,0002,117,632stderr