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 11, 2026 18:11olliecrowolliecrowScore: 6,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 23:215,79273,341,38042,067,0006,009,0002,383,872
2Feb 2, 2026 23:215,84375,725,46542,434,0006,062,0002,285,568
3Feb 11, 2026 18:115,84472,578,18544,461,0004,041,0002,441,216
4Feb 11, 2026 18:115,84572,995,21344,470,0004,042,0002,260,992
5Feb 2, 2026 23:215,86384,499,30541,714,0006,952,0002,379,776
6Feb 11, 2026 18:115,89179,047,41044,904,0003,991,0002,383,872
7Feb 2, 2026 23:216,34282,919,52645,688,0006,952,0002,469,888
8Feb 11, 2026 18:116,34383,828,43542,714,0009,933,0002,400,256
9Feb 2, 2026 23:216,35685,106,04844,793,0007,963,0002,420,736
10Feb 11, 2026 18:116,38579,325,91346,995,0005,999,0002,473,984
11Feb 2, 2026 23:216,40086,111,54444,098,0009,020,0002,506,752
12Feb 11, 2026 18:116,47788,105,82048,784,0004,977,0002,285,568