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 10, 2026 20:27Daniel MastalerzDaniel MastalerzScore: 8,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 20:278,20793,316,82565,112,0003,005,0002,326,528
2Feb 10, 2026 20:278,21491,708,95364,170,0004,010,0002,265,088
3Feb 10, 2026 20:278,22295,728,16566,233,0002,007,0002,310,144
4Feb 10, 2026 20:278,231102,868,22665,301,0003,013,0002,326,528
5Feb 10, 2026 20:278,23189,087,56364,303,0004,018,0002,379,776
6Feb 10, 2026 20:278,23296,212,99464,310,0004,019,0002,326,528
7Feb 10, 2026 20:278,24192,591,66165,383,0003,017,0002,326,528
8Feb 10, 2026 20:278,26394,277,29964,610,0003,976,0002,326,528
9Feb 10, 2026 20:278,264100,546,01667,582,0001,008,0002,269,184
10Feb 10, 2026 20:278,38996,705,93066,599,0003,027,0002,265,088
11Feb 10, 2026 20:278,39195,822,93967,625,0002,018,0002,269,184
12Feb 10, 2026 20:278,40794,842,65065,789,0003,987,0002,273,280