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 12, 2026 15:20Victor MerckléVictor MerckléScore: 3,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 15:213,74739,494,08829,993,0001,113,0002,117,632stderr
2Aug 12, 2026 15:213,75539,598,77030,031,0001,139,0002,117,632stderr
3Aug 12, 2026 15:213,76740,035,75330,188,0001,086,0002,117,632stderr
4Aug 12, 2026 15:213,77539,560,39330,214,0001,126,0002,117,632stderr
5Aug 12, 2026 15:213,77639,754,32730,146,0001,196,0002,117,632stderr
6Aug 12, 2026 15:213,78139,801,22930,248,0001,138,0002,117,632stderr
7Aug 12, 2026 15:213,79239,870,51530,367,0001,111,0002,117,632stderr
8Aug 12, 2026 15:213,79539,906,91330,414,0001,085,0002,117,632stderr
9Aug 12, 2026 15:213,80339,975,49630,453,0001,117,0002,117,632stderr