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 7, 2026 13:00Daniel MastalerzDaniel MastalerzScore: 40,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 13:0040,116356,142,134332,965,00002,396,160
2Feb 7, 2026 13:0040,433361,753,843333,601,0001,997,0002,392,064
3Feb 7, 2026 13:0040,484359,080,668335,017,0001,000,0002,392,064
4Feb 7, 2026 13:0040,500360,073,047335,153,0001,000,0002,514,944
5Feb 7, 2026 13:0040,507363,950,161335,212,0001,000,0002,269,184
6Feb 7, 2026 13:0040,521364,721,380335,323,0001,000,0002,269,184
7Feb 7, 2026 13:0040,528370,665,775336,386,00002,269,184
8Feb 7, 2026 13:0040,559366,639,615335,642,000998,0002,269,184
9Feb 7, 2026 13:0040,624364,251,524336,180,0001,000,0002,404,352