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 listFeb 1, 2026 15:14kkxkkxScore: 67,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2026 15:1467,292591,853,742496,575,00061,947,0002,277,376
2Feb 1, 2026 15:1467,309587,582,673497,702,00060,963,0002,277,376
3Feb 1, 2026 15:1467,441586,129,705497,785,00061,973,0002,277,376
4Feb 1, 2026 15:1467,465582,460,035499,961,00059,995,0002,375,680
5Feb 1, 2026 15:1467,483587,375,071500,095,00060,011,0002,277,376
6Feb 1, 2026 15:1467,518584,364,695496,469,00063,931,0002,383,872
7Feb 1, 2026 15:1467,556588,175,142499,744,00060,968,0002,277,376
8Feb 1, 2026 15:1467,637590,053,271499,456,00061,932,0002,277,376
9Feb 1, 2026 15:1467,802584,011,964496,785,00065,971,0002,383,872