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 25, 2022 14:18Yuriy LyfenkoYuriy LyfenkoScore: 17,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2022 14:1817,310170,437,238141,674,0001,995,0002,437,120
2Jul 25, 2022 14:1817,319176,616,121140,755,0002,994,0002,392,064
3Jul 25, 2022 14:1817,320167,499,853141,756,0001,996,0002,424,832
4Jul 25, 2022 14:1817,330167,172,175141,838,0001,997,0002,412,544
5Jul 25, 2022 14:1817,441171,705,062141,765,0002,995,0002,392,064
6Jul 25, 2022 14:1817,453200,502,249144,863,38002,289,664
7Jul 25, 2022 14:1817,454205,535,111144,869,07602,240,512
8Jul 25, 2022 14:1817,480171,617,267144,088,0001,000,0002,424,832
9Jul 25, 2022 14:1817,503175,231,880142,270,0003,005,0002,465,792
10Jul 25, 2022 14:1817,857169,809,389145,210,0003,004,0002,510,848
11Jul 25, 2022 14:1817,889171,155,602147,473,0001,003,0002,433,024
12Jul 25, 2022 14:1818,110212,127,621150,315,70802,256,896