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 listOct 27, 2024 10:52Xushi8Xushi8Score: 383,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2024 10:52382,3243,197,378,5822,952,409,000220,880,0002,404,352
2Oct 27, 2024 10:52382,5883,199,527,6812,945,594,000229,890,0002,519,040
3Oct 27, 2024 10:52382,7833,204,367,9052,954,231,000222,866,0002,514,944
4Oct 27, 2024 10:52382,8513,203,645,2182,949,833,000227,832,0002,469,888
5Oct 27, 2024 10:52383,0263,206,318,7102,946,256,000232,862,0002,420,736
6Oct 27, 2024 10:52383,5213,212,083,4972,955,349,000227,872,0002,420,736
7Oct 27, 2024 10:52383,5563,214,314,7062,966,618,000216,899,0002,428,928
8Oct 27, 2024 10:52384,2463,213,952,3322,951,370,000237,868,0002,469,888
9Oct 27, 2024 10:52385,0953,227,376,4492,969,408,000226,878,0002,424,832