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 20, 2024 14:20Javid izadiJavid izadiScore: 105,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2024 14:20105,676898,083,961877,109,00002,285,568
2Dec 20, 2024 14:20105,682909,752,153876,159,0001,000,0002,285,568
3Dec 20, 2024 14:20105,687904,580,924876,206,0001,000,0002,285,568
4Dec 20, 2024 14:20105,694903,921,603875,263,0001,998,0002,285,568
5Dec 20, 2024 14:20105,699905,433,773875,305,0001,998,0002,363,392
6Dec 20, 2024 14:20105,703907,177,437876,336,000999,0002,285,568
7Dec 20, 2024 14:20105,715907,533,197875,440,0001,998,0002,371,584
8Dec 20, 2024 14:20105,715910,121,328875,438,0001,998,0002,285,568
9Dec 20, 2024 14:20105,798905,959,435877,122,0001,000,0002,285,568