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:04poilonpoilonScore: 15,998Success
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:0415,911142,016,137131,062,0001,007,0002,113,536
2May 19, 2026 08:0415,972144,625,028131,562,0001,006,0002,113,536
3May 19, 2026 08:0415,979144,150,993131,626,0001,005,0002,113,536
4May 19, 2026 08:0415,994143,707,363131,749,0001,005,0002,113,536
5May 19, 2026 08:0415,998144,719,767131,784,0001,006,0002,113,536
6May 19, 2026 08:0416,012142,578,736131,901,0001,005,0002,113,536
7May 19, 2026 08:0416,025142,099,545132,002,0001,006,0002,113,536
8May 19, 2026 08:0416,049143,078,073132,207,0001,006,0002,113,536
9May 19, 2026 08:0416,061143,355,597132,306,0001,005,0002,113,536