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 listMay 9, 2026 12:52wnwnScore: 3,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:533,37342,381,14926,963,0001,035,0002,482,176
2May 9, 2026 12:533,38041,614,56227,001,0001,056,0002,486,272
3May 9, 2026 12:533,38543,053,58827,048,0001,050,0002,486,272
4May 9, 2026 12:533,38942,273,17527,082,0001,049,0002,494,464
5May 9, 2026 12:533,40544,250,88627,164,0001,103,0002,490,368
6May 9, 2026 12:533,41143,003,27927,285,0001,031,0002,478,080
7May 9, 2026 12:533,54443,506,63728,369,0001,054,0002,482,176
8May 9, 2026 12:533,56643,750,94728,521,0001,083,0002,486,272
9May 9, 2026 12:533,57545,146,82928,619,0001,058,0002,494,464