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 listJul 18, 2024 10:37Andrey LikhachevAndrey LikhachevScore: 12,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2024 10:3712,291129,456,409101,014,0001,000,0002,363,392
2Jul 18, 2024 10:3712,291129,695,574100,018,0002,000,0002,285,568
3Jul 18, 2024 10:3712,299124,126,389100,082,0002,001,0002,371,584
4Jul 18, 2024 10:3712,300129,853,570100,086,0002,001,0002,375,680
5Jul 18, 2024 10:3712,302126,035,131101,107,0001,001,0002,285,568
6Jul 18, 2024 10:3712,313124,880,626100,193,0002,003,0002,285,568
7Jul 18, 2024 10:3712,321128,833,104101,260,0001,002,0002,367,488
8Jul 18, 2024 10:3712,339127,313,076102,413,00002,285,568
9Jul 18, 2024 10:3712,345125,317,820102,467,00002,379,776
10Jul 18, 2024 10:3712,490171,884,651103,665,55902,228,224
11Jul 18, 2024 10:3712,491162,705,909103,674,05402,220,032
12Jul 18, 2024 10:3712,506169,738,659103,796,39402,220,032