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 29, 2026 18:58Danylo MocherniukDanylo MocherniukScore: 10,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 18:5810,457119,268,48085,798,000997,0002,510,848
2Mar 29, 2026 18:5810,465111,578,64884,867,0001,996,0002,293,760
3Mar 29, 2026 18:5810,500109,365,22885,144,0002,003,0002,293,760
4Mar 29, 2026 18:5810,506110,999,94385,193,0002,004,0002,506,752
5Mar 29, 2026 18:5810,520113,239,68685,311,0002,007,0002,502,656
6Mar 29, 2026 18:5810,521114,199,96085,317,0002,007,0002,293,760
7Mar 29, 2026 18:5810,522111,239,20786,328,0001,003,0002,506,752
8Mar 29, 2026 18:5810,526117,621,10185,361,0002,008,0002,293,760
9Mar 29, 2026 18:5810,530110,179,72286,392,0001,004,0002,293,760