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 24, 2026 22:39Victor MerckléVictor MerckléScore: 3,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 22:403,73239,421,02429,870,0001,112,0002,117,632stderr
2Aug 24, 2026 22:403,75239,513,30830,031,0001,114,0002,117,632stderr
3Aug 24, 2026 22:403,75339,622,44929,987,0001,164,0002,117,632stderr
4Aug 24, 2026 22:403,76439,697,94530,146,0001,101,0002,117,632stderr
5Aug 24, 2026 22:403,76839,531,00430,183,0001,094,0002,117,632stderr
6Aug 24, 2026 22:403,77039,705,43830,191,0001,101,0002,117,632stderr
7Aug 24, 2026 22:403,77139,660,55430,189,0001,118,0002,117,632stderr
8Aug 24, 2026 22:403,81640,067,61030,573,0001,103,0002,117,632stderr
9Aug 24, 2026 22:403,85241,591,56830,833,0001,142,0002,117,632stderr