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 listMay 8, 2026 17:55Hung T.NguyenHung T.NguyenScore: 61,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2026 17:5660,353520,278,053499,868,0001,062,0002,351,104
2May 8, 2026 17:5660,450518,094,693500,587,0001,155,0002,351,104
3May 8, 2026 17:5660,734523,422,509502,924,0001,174,0002,351,104
4May 8, 2026 17:5660,922524,396,633504,438,0001,217,0002,363,392
5May 8, 2026 17:5661,189527,096,776506,659,0001,214,0002,367,488
6May 8, 2026 17:5661,475527,973,117509,145,0001,099,0002,371,584
7May 8, 2026 17:5661,578527,963,535509,891,0001,207,0002,367,488
8May 8, 2026 17:5661,864531,650,009512,375,0001,104,0002,351,104
9May 8, 2026 17:5661,949533,528,627513,026,0001,152,0002,359,296