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 listJul 16, 2026 08:46boop34boop34Score: 8,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 08:468,94083,802,02272,954,0001,251,0002,113,536
2Jul 16, 2026 08:468,94283,927,70473,028,0001,196,0002,113,536
3Jul 16, 2026 08:468,95485,182,45273,126,0001,196,0002,113,536
4Jul 16, 2026 08:468,95583,915,63873,119,0001,210,0002,113,536
5Jul 16, 2026 08:468,95683,853,80273,135,0001,204,0002,113,536
6Jul 16, 2026 08:468,95683,961,97073,231,0001,108,0002,113,536
7Jul 16, 2026 08:468,95683,894,63473,233,0001,103,0002,113,536
8Jul 16, 2026 08:468,96484,035,17873,211,0001,194,0002,113,536
9Jul 16, 2026 08:469,24586,324,39775,530,0001,204,0002,113,536