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 listMar 6, 2026 17:54wnwnScore: 4,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 18:114,32462,276,57133,896,0001,993,0002,490,368
2Mar 6, 2026 18:114,32959,537,70133,937,0001,996,0002,273,280
3Mar 6, 2026 17:544,34055,852,81334,025,0002,001,0002,490,368
4Mar 6, 2026 18:114,34758,503,70434,073,0002,004,0002,273,280
5Mar 6, 2026 18:114,37862,006,40335,330,0001,009,0002,273,280
6Mar 6, 2026 18:114,38259,691,29435,362,0001,010,0002,498,560
7Mar 6, 2026 17:544,38355,002,28035,370,0001,010,0002,273,280
8Mar 6, 2026 18:114,40060,143,47235,504,0001,014,0002,498,560
9Mar 6, 2026 18:114,40455,454,19235,540,0001,015,0002,498,560
10Mar 6, 2026 18:114,43868,454,57734,842,0001,991,0002,273,280
11Mar 6, 2026 17:544,44858,833,47434,923,0001,995,0002,531,328
12Mar 6, 2026 18:114,46066,307,28935,020,0002,001,0002,490,368