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 listJan 23, 2025 04:30eui hyeon kimeui hyeon kimScore: 229,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 04:30229,6521,936,174,6911,836,141,00069,967,0002,269,184
2Jan 23, 2025 04:30229,7481,931,482,2671,848,946,00057,966,0002,289,664
3Jan 23, 2025 04:30229,7701,933,986,8331,841,125,00065,968,0002,273,280
4Jan 23, 2025 04:30229,8331,936,863,8351,847,658,00059,956,0002,289,664
5Jan 23, 2025 04:30229,8461,934,366,9531,841,769,00065,955,0002,285,568
6Jan 23, 2025 04:30229,9281,943,613,2981,841,422,00066,978,0002,523,136
7Jan 23, 2025 04:30230,0241,937,526,5901,841,226,00067,971,0002,285,568
8Jan 23, 2025 04:30230,5401,941,789,6591,848,497,00064,982,0002,289,664
9Jan 23, 2025 04:30231,1931,945,968,5741,838,950,00079,954,0002,281,472