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 10, 2026 16:32Victor MerckléVictor MerckléScore: 5,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 16:335,59354,729,52945,292,0001,131,0002,117,632stderr
2Aug 10, 2026 16:335,60054,603,24345,370,0001,114,0002,117,632stderr
3Aug 10, 2026 16:335,60454,872,91845,421,0001,099,0002,117,632stderr
4Aug 10, 2026 16:335,60956,530,25945,446,0001,109,0002,117,632stderr
5Aug 10, 2026 16:335,61454,814,29745,487,0001,111,0002,117,632stderr
6Aug 10, 2026 16:335,63054,912,18745,655,0001,081,0002,117,632stderr
7Aug 10, 2026 16:335,63954,944,68345,801,0001,010,0002,117,632stderr
8Aug 10, 2026 16:335,73055,730,55946,448,0001,118,0002,117,632stderr
9Aug 10, 2026 16:335,79156,309,06147,038,0001,031,0002,117,632stderr