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 listSep 29, 2026 16:06parastromparastromScore: 4,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 16:084,80050,359,46638,770,0001,072,0002,113,536
2Sep 29, 2026 16:084,80350,363,52738,826,0001,045,0002,113,536
3Sep 29, 2026 16:084,80450,273,29838,808,0001,069,0002,113,536
4Sep 29, 2026 16:084,82550,603,57438,981,0001,073,0002,113,536
5Sep 29, 2026 16:084,83550,547,03039,083,0001,051,0002,113,536
6Sep 29, 2026 16:084,86050,837,78939,229,0001,116,0002,113,536
7Sep 29, 2026 16:084,86250,838,75139,234,0001,128,0002,113,536
8Sep 29, 2026 16:084,86550,829,09639,206,0001,181,0002,113,536
9Sep 29, 2026 16:084,92051,371,21439,687,0001,154,0002,113,536