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 listOct 22, 2025 13:08caandocaandoScore: 5,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 13:085,88380,125,98947,835,000996,0002,285,568
2Oct 22, 2025 13:085,88471,651,49047,824,0001,017,0002,510,848
3Oct 22, 2025 13:085,88571,724,15146,851,0001,993,0002,285,568
4Oct 22, 2025 13:085,88669,762,23146,859,0001,994,0002,523,136
5Oct 22, 2025 13:085,90373,202,96246,997,0001,999,0002,285,568
6Oct 22, 2025 13:085,91475,514,91647,083,0002,003,0002,510,848
7Oct 22, 2025 13:085,91472,064,11748,086,0001,001,0002,273,280
8Oct 22, 2025 13:085,93069,290,57647,209,0002,008,0002,363,392
9Oct 22, 2025 13:085,98177,934,69248,630,0001,013,0002,285,568
10Oct 22, 2025 13:086,00182,134,40447,816,0001,992,0002,523,136
11Oct 22, 2025 13:086,00472,875,95348,816,0001,017,0002,285,568
12Oct 22, 2025 13:086,02774,306,20648,023,0002,000,0002,285,568