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 listMay 19, 2026 08:05poilonpoilonScore: 15,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 08:0515,831142,935,674130,395,0001,005,0002,113,536
2May 19, 2026 08:0515,833142,613,894130,416,0001,005,0002,113,536
3May 19, 2026 08:0515,843142,465,544130,497,0001,006,0002,113,536
4May 19, 2026 08:0515,850142,024,977130,550,0001,006,0002,113,536
5May 19, 2026 08:0515,859141,081,177130,626,0001,006,0002,113,536
6May 19, 2026 08:0515,976141,824,575131,595,0001,007,0002,113,536
7May 19, 2026 08:0516,009144,358,055131,873,0001,006,0002,113,536
8May 19, 2026 08:0516,025142,134,397132,009,0001,006,0002,113,536
9May 19, 2026 08:0516,028144,089,227132,030,0001,006,0002,113,536