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 12, 2024 10:44KrishanKrishanScore: 396,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 10:44394,0973,299,329,7373,208,045,00062,961,0002,293,760
2Nov 12, 2024 10:44394,3043,300,841,6773,202,772,00069,951,0002,285,568
3Nov 12, 2024 10:44394,6883,307,387,8453,211,955,00063,959,0002,285,568
4Nov 12, 2024 10:44394,8833,301,400,7593,210,556,00066,969,0002,285,568
5Nov 12, 2024 10:44396,3783,320,686,0463,211,962,00077,974,0002,285,568
6Nov 12, 2024 10:44396,7613,321,391,5643,221,160,00071,958,0002,293,760
7Nov 12, 2024 10:44399,0783,343,824,4373,251,381,00060,969,0002,293,760
8Nov 12, 2024 10:44399,8753,349,477,0453,261,000,00057,964,0002,293,760
9Nov 12, 2024 10:44401,4743,358,591,5873,256,272,00075,959,0002,289,664