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 09:04Danylo MocherniukDanylo MocherniukScore: 56,030Success
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 09:0456,016487,992,255462,935,0001,999,0002,347,008
2Mar 29, 2026 09:0456,021490,654,608461,978,0002,999,0002,502,656
3Mar 29, 2026 09:0456,025487,955,271460,006,0005,000,0002,281,472
4Mar 29, 2026 09:0456,025489,365,224463,009,0002,000,0002,281,472
5Mar 29, 2026 09:0456,030490,724,415463,050,0002,000,0002,281,472
6Mar 29, 2026 09:0456,036491,026,270463,100,0002,000,0002,281,472
7Mar 29, 2026 09:0456,038493,090,787463,113,0002,000,0002,342,912
8Mar 29, 2026 09:0456,043487,554,597464,161,0001,000,0002,330,624
9Mar 29, 2026 09:0456,066487,443,801464,348,0001,000,0002,342,912