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 listApr 25, 2025 20:33nnScore: 394,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2025 20:33393,2953,292,282,7673,211,375,00052,973,0002,281,472
2Apr 25, 2025 20:33393,4203,299,130,8943,196,445,00068,944,0002,285,568
3Apr 25, 2025 20:33393,7893,295,024,1403,214,478,00053,974,0002,285,568
4Apr 25, 2025 20:33394,1073,296,066,9153,203,127,00067,960,0002,281,472
5Apr 25, 2025 20:33394,3323,297,045,2143,219,971,00052,983,0002,355,200
6Apr 25, 2025 20:33394,3543,300,977,5973,226,167,00046,973,0002,285,568
7Apr 25, 2025 20:33396,3943,314,716,1343,219,115,00070,958,0002,285,568
8Apr 25, 2025 20:33400,7893,350,838,6643,273,576,00052,976,0002,289,664
9Apr 25, 2025 20:33408,5593,423,864,6393,331,073,00059,965,0002,285,568