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 1, 2026 21:16wnwnScore: 4,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2026 21:174,40463,545,18135,541,0001,015,0002,277,376
2Mar 1, 2026 21:174,40560,112,60935,543,0001,015,0002,277,376
3Mar 1, 2026 21:164,43666,521,71934,829,0001,990,0002,277,376
4Mar 1, 2026 21:164,44156,569,21134,867,0001,992,0002,494,464
5Mar 1, 2026 21:174,46564,183,29635,053,0002,003,0002,498,560
6Mar 1, 2026 21:174,46565,647,53835,053,0002,003,0002,494,464
7Mar 1, 2026 21:174,52166,183,23936,511,0001,014,0002,277,376
8Mar 1, 2026 21:164,53260,092,56236,599,0001,016,0002,277,376
9Mar 1, 2026 21:174,55362,235,91436,797,000994,0002,486,272