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 listSep 27, 2024 17:08Drew GarciaDrew GarciaScore: 58,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2024 17:0858,900514,815,004486,870,0001,999,0002,269,184
2Sep 27, 2024 17:0858,900520,611,688486,875,0001,999,0002,412,544
3Sep 27, 2024 17:0858,901509,050,426485,878,0002,999,0002,269,184
4Sep 27, 2024 17:0858,901514,237,125486,881,0001,999,0002,396,160
5Sep 27, 2024 17:0858,903511,454,274486,896,0001,999,0002,400,256
6Sep 27, 2024 17:0858,904519,530,630486,902,0001,999,0002,269,184
7Sep 27, 2024 17:0858,912519,702,748487,970,000999,0002,392,064
8Sep 27, 2024 17:0858,913509,888,911486,977,0001,999,0002,269,184
9Sep 27, 2024 17:0858,923519,623,958489,058,00002,396,160