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 13:05Victor MerckléVictor MerckléScore: 3,801Success
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 13:053,77839,732,55130,262,0001,099,0002,117,632stderr
2Aug 12, 2026 13:053,77939,723,76030,237,0001,134,0002,117,632stderr
3Aug 12, 2026 13:053,78039,823,09030,288,0001,088,0002,117,632stderr
4Aug 12, 2026 13:053,79039,871,64330,387,0001,078,0002,117,632stderr
5Aug 12, 2026 13:053,80139,906,38830,449,0001,103,0002,117,632stderr
6Aug 12, 2026 13:053,80341,057,55830,442,0001,123,0002,117,632stderr
7Aug 12, 2026 13:053,83940,300,25730,801,0001,070,0002,117,632stderr
8Aug 12, 2026 13:053,84140,303,97630,762,0001,121,0002,117,632stderr
9Aug 12, 2026 13:054,05242,079,17132,511,0001,127,0002,117,632stderr