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 25, 2026 15:38Victor MerckléVictor MerckléScore: 8,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 15:398,58579,599,19069,013,0002,250,0002,117,632stderr
2Aug 25, 2026 15:398,60379,827,22469,253,0002,157,0002,117,632stderr
3Aug 25, 2026 15:398,61479,945,68269,249,0002,255,0002,117,632stderr
4Aug 25, 2026 15:398,61579,858,76369,343,0002,164,0002,117,632stderr
5Aug 25, 2026 15:398,66380,291,23169,723,0002,182,0002,117,632stderr
6Aug 25, 2026 15:398,93982,586,74872,025,0002,170,0002,117,632stderr
7Aug 25, 2026 15:398,95982,793,59772,101,0002,261,0002,117,632stderr
8Aug 25, 2026 15:399,00183,067,46472,456,0002,253,0002,117,632stderr
9Aug 25, 2026 15:399,01283,070,19272,641,0002,165,0002,117,632stderr