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 25, 2024 19:16Alexander KrivolapovAlexander KrivolapovScore: 19,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2024 19:1619,818188,394,388164,490,00002,506,752
2Mar 25, 2024 19:1619,839228,940,427164,661,16102,240,512
3Mar 25, 2024 19:1619,859196,564,933163,832,000998,0002,285,568
4Mar 25, 2024 19:1619,862189,618,158162,854,0001,998,0002,285,568
5Mar 25, 2024 19:1619,867190,788,867162,898,0001,998,0002,506,752
6Mar 25, 2024 19:1619,868191,785,238163,907,000999,0002,285,568
7Mar 25, 2024 19:1619,877191,952,474163,981,000999,0002,285,568
8Mar 25, 2024 19:1619,885186,838,282164,042,0001,000,0002,285,568
9Mar 25, 2024 19:1619,890189,976,458163,082,0002,001,0002,506,752
10Mar 25, 2024 19:1619,900191,960,140163,165,0002,002,0002,285,568
11Mar 25, 2024 19:1620,180245,235,149167,497,47802,236,416
12Mar 25, 2024 19:1620,200238,092,543167,663,74302,220,032