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 29, 2025 11:19eandr-67eandr-67Score: 272,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 11:19272,5912,294,781,8982,152,580,000109,927,0002,326,528
2Oct 29, 2025 11:19272,6272,289,570,9952,162,855,00099,947,0002,326,528
3Oct 29, 2025 11:19272,7112,289,652,3872,145,581,000117,922,0002,326,528
4Oct 29, 2025 11:19272,7602,295,331,5112,132,973,000130,936,0002,326,528
5Oct 29, 2025 11:19272,7932,291,351,6472,165,219,00098,964,0002,326,528
6Oct 29, 2025 11:19272,7972,290,964,2342,153,304,000110,912,0002,326,528
7Oct 29, 2025 11:19272,8572,287,136,3642,171,766,00092,947,0002,326,528
8Oct 29, 2025 11:19273,1072,296,812,5852,170,843,00095,948,0002,433,024
9Oct 29, 2025 11:19273,2162,290,452,1542,162,800,000104,893,0002,326,528