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 listSep 2, 2026 04:43Victor MerckléVictor MerckléScore: 3,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 04:443,65138,668,93129,219,0001,087,0002,117,632stderr
2Sep 2, 2026 04:443,66138,853,06929,249,0001,144,0002,117,632stderr
3Sep 2, 2026 04:443,67438,949,26929,345,0001,154,0002,117,632stderr
4Sep 2, 2026 04:443,67739,627,41229,390,0001,136,0002,117,632stderr
5Sep 2, 2026 04:443,68039,633,48129,409,0001,139,0002,117,632stderr
6Sep 2, 2026 04:443,69539,107,36429,546,0001,128,0002,117,632stderr
7Sep 2, 2026 04:443,70639,888,63429,620,0001,144,0002,117,632stderr
8Sep 2, 2026 04:443,71739,961,81029,690,0001,169,0002,117,632stderr
9Sep 2, 2026 04:443,74139,425,44429,917,0001,138,0002,117,632stderr