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 listDec 27, 2024 16:10Uladzislau NestsiarukUladzislau NestsiarukScore: 96,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2024 16:1095,918817,387,006743,112,00053,008,0002,277,376
2Dec 27, 2024 16:1095,987825,437,275739,711,00056,977,0002,289,664
3Dec 27, 2024 16:1095,991818,777,498736,749,00059,979,0002,277,376
4Dec 27, 2024 16:1095,991819,746,166739,744,00056,980,0002,273,280
5Dec 27, 2024 16:1096,018823,964,839736,951,00059,996,0002,289,664
6Dec 27, 2024 16:1096,031819,580,591744,055,00053,003,0002,281,472
7Dec 27, 2024 16:1096,036821,085,646741,091,00056,006,0002,289,664
8Dec 27, 2024 16:1096,060823,589,032742,278,00055,020,0002,289,664
9Dec 27, 2024 16:1096,125820,781,717737,847,00059,987,0002,277,376