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 18:21Victor MerckléVictor MerckléScore: 64,081Success
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 18:2163,519535,556,839526,188,0001,026,0002,117,632stderr
2Aug 24, 2026 18:2163,524535,589,637526,255,0001,002,0002,117,632stderr
3Aug 24, 2026 18:2163,538539,925,008526,350,0001,017,0002,117,632stderr
4Aug 24, 2026 18:2164,024539,656,621530,389,0001,013,0002,117,632stderr
5Aug 24, 2026 18:2164,081541,564,694530,857,0001,017,0002,117,632stderr
6Aug 24, 2026 18:2164,289546,560,012532,516,0001,084,0002,117,632stderr
7Aug 24, 2026 18:2164,436543,170,536533,820,0001,006,0002,117,632stderr
8Aug 24, 2026 18:2164,505548,794,409534,271,0001,126,0002,117,632stderr
9Aug 24, 2026 18:2165,309554,751,823540,975,0001,097,0002,117,632stderr