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 29, 2026 15:45Victor MerckléVictor MerckléScore: 3,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 15:453,60938,283,23428,878,0001,077,0002,117,632stderr
2Aug 29, 2026 15:453,62438,434,13829,034,0001,047,0002,117,632stderr
3Aug 29, 2026 15:453,65438,674,16329,304,0001,032,0002,117,632stderr
4Aug 29, 2026 15:453,71039,140,89629,680,0001,115,0002,117,632stderr
5Aug 29, 2026 15:453,71639,188,41829,804,0001,042,0002,117,632stderr
6Aug 29, 2026 15:453,71739,247,50629,824,0001,029,0002,117,632stderr
7Aug 29, 2026 15:453,72940,040,11129,940,0001,016,0002,117,632stderr
8Aug 29, 2026 15:453,78240,445,80430,301,0001,096,0002,117,632stderr
9Aug 29, 2026 15:453,79539,941,33530,461,0001,044,0002,117,632stderr