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 30, 2026 19:31Chandaluru Hema Venkata RaadhesChandaluru Hema Venkata RaadhesScore: 2,068,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 19:312,067,85017,196,399,99917,081,193,00081,962,0002,281,472
2Mar 30, 2026 19:312,067,95917,194,117,94317,080,107,00083,956,0002,281,472
3Mar 30, 2026 19:312,068,15417,195,555,27617,083,717,00081,960,0002,281,472
4Mar 30, 2026 19:312,068,19517,199,559,76617,107,043,00058,976,0002,281,472
5Mar 30, 2026 19:312,068,26917,198,228,58117,095,666,00070,965,0002,281,472
6Mar 30, 2026 19:312,068,76617,203,412,82417,102,790,00067,967,0002,281,472
7Mar 30, 2026 19:312,068,82217,200,722,32417,101,261,00069,964,0002,281,472
8Mar 30, 2026 19:312,069,33817,210,338,40217,112,532,00062,972,0002,281,472
9Mar 30, 2026 19:312,070,49217,220,177,05417,115,118,00069,963,0002,281,472