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 23, 2026 21:32Daniel MastalerzDaniel MastalerzScore: 5,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 21:325,57969,376,41344,294,0002,013,0002,502,656
2Feb 23, 2026 21:325,59870,572,36544,443,0002,020,0002,285,568
3Feb 23, 2026 21:325,64471,566,37044,854,0001,993,0002,502,656
4Feb 23, 2026 21:325,69172,062,95845,226,0002,010,0002,281,472
5Feb 23, 2026 21:325,71669,828,57745,422,0002,018,0002,277,376
6Feb 23, 2026 21:326,00279,497,02047,821,0001,992,0002,498,560