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 listMar 27, 2026 15:50SabadonSabadonScore: 98,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 15:5097,643836,488,221744,487,00065,954,0002,314,240
2Mar 27, 2026 15:5097,728840,743,416752,134,00059,010,0002,326,528
3Mar 27, 2026 15:5098,001839,108,703763,449,00049,963,0002,367,488
4Mar 27, 2026 15:5098,116845,643,375756,411,00057,954,0002,326,528
5Mar 27, 2026 15:5098,292841,089,053758,836,00056,987,0002,428,928
6Mar 27, 2026 15:5098,379845,101,871755,577,00060,965,0002,371,584
7Mar 27, 2026 15:5098,565849,465,664755,083,00063,006,0002,326,528
8Mar 27, 2026 15:5099,099846,953,455757,560,00064,962,0002,326,528
9Mar 27, 2026 15:5099,154849,418,212756,982,00065,998,0002,326,528