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 listApr 27, 2026 10:12wnwnScore: 3,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:153,40040,888,84827,217,0001,008,0002,555,904
2Apr 27, 2026 10:153,40640,470,67727,261,0001,009,0002,490,368
3Apr 27, 2026 10:153,43345,025,93927,481,0001,017,0002,486,272
4Apr 27, 2026 10:153,46046,456,56827,698,0001,025,0002,482,176
5Apr 27, 2026 10:153,49147,429,54526,982,0001,998,0002,478,080
6Apr 27, 2026 10:153,52643,316,69128,263,0001,009,0002,551,808
7Apr 27, 2026 10:153,53448,103,38728,323,0001,011,0002,486,272
8Apr 27, 2026 10:153,63346,549,00828,147,0002,010,0002,330,624
9Apr 27, 2026 10:153,64548,116,49329,252,0001,008,0002,478,080