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 26, 2026 19:50Victor MerckléVictor MerckléScore: 3,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 19:503,78739,731,44130,185,0001,255,0002,117,632stderr
2Aug 26, 2026 19:503,78939,748,39530,266,0001,185,0002,117,632stderr
3Aug 26, 2026 19:503,79039,794,76630,442,0001,022,0002,117,632stderr
4Aug 26, 2026 19:503,79539,813,85330,326,0001,176,0002,117,632stderr
5Aug 26, 2026 19:503,80039,766,96830,288,0001,257,0002,117,632stderr
6Aug 26, 2026 19:503,81540,033,38430,361,0001,305,0002,117,632stderr
7Aug 26, 2026 19:503,82740,821,75030,506,0001,259,0002,117,632stderr
8Aug 26, 2026 19:503,93240,909,71931,420,0001,221,0002,117,632stderr
9Aug 26, 2026 19:504,05642,651,44332,648,0001,020,0002,117,632stderr