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 10:02Danylo MocherniukDanylo MocherniukScore: 44,071Success
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 10:0244,044396,637,758362,570,0002,996,0002,281,472
2Mar 29, 2026 10:0244,059391,620,329362,690,0002,997,0002,506,752
3Mar 29, 2026 10:0244,063392,688,747363,721,0001,998,0002,281,472
4Mar 29, 2026 10:0244,064393,113,446362,738,0002,997,0002,281,472
5Mar 29, 2026 10:0244,071389,988,407363,792,0001,998,0002,281,472
6Mar 29, 2026 10:0244,080390,235,368363,861,0001,999,0002,281,472
7Mar 29, 2026 10:0244,080395,115,500362,863,0002,998,0002,506,752
8Mar 29, 2026 10:0244,091394,236,435361,959,0003,999,0002,281,472
9Mar 29, 2026 10:0244,112388,859,820364,127,0002,000,0002,281,472