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 3, 2026 22:15Tim RaddatzTim RaddatzScore: 11,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 22:1511,908109,139,04397,758,0001,086,0002,113,536
2Oct 3, 2026 22:1511,926109,263,48897,904,0001,085,0002,113,536
3Oct 3, 2026 22:1511,933109,396,91597,946,0001,098,0002,113,536
4Oct 3, 2026 22:1511,941110,803,26397,897,0001,217,0002,113,536
5Oct 3, 2026 22:1511,942109,404,97198,027,0001,099,0002,113,536
6Oct 3, 2026 22:1511,985109,736,68198,390,0001,091,0002,113,536
7Oct 3, 2026 22:1511,986109,883,60998,388,0001,097,0002,113,536
8Oct 3, 2026 22:1511,991109,785,74998,399,0001,129,0002,113,536
9Oct 3, 2026 22:1512,034110,182,39198,760,0001,127,0002,113,536