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 listNov 2, 2024 18:27zielajzielajScore: 1,822,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2024 18:271,821,59715,151,986,67515,042,281,00076,970,0002,281,472
2Nov 2, 2024 18:271,821,64815,150,006,48815,050,711,00068,966,0002,281,472
3Nov 2, 2024 18:271,821,76815,158,887,88315,051,705,00068,971,0002,285,568
4Nov 2, 2024 18:271,822,41415,160,385,22215,058,064,00067,973,0002,285,568
5Nov 2, 2024 18:271,822,42015,161,504,86915,060,113,00065,974,0002,281,472
6Nov 2, 2024 18:271,822,42415,159,582,05815,069,143,00056,977,0002,363,392
7Nov 2, 2024 18:271,823,30415,164,594,14515,063,453,00069,969,0002,527,232
8Nov 2, 2024 18:271,826,23215,192,343,64215,084,755,00072,969,0002,285,568
9Nov 2, 2024 18:271,827,32415,207,004,94515,108,818,00057,972,0002,281,472