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 25, 2026 18:39boop34boop34Score: 9,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 18:399,21986,428,59975,288,0001,236,0002,113,536
2Jul 25, 2026 18:399,26386,849,15575,756,0001,128,0002,113,536
3Jul 25, 2026 18:399,28186,858,53675,813,0001,225,0002,113,536
4Jul 25, 2026 18:399,29587,048,53475,983,0001,168,0002,113,536
5Jul 25, 2026 18:399,34087,442,60976,403,0001,126,0002,113,536
6Jul 25, 2026 18:399,66590,016,20979,069,0001,152,0002,113,536
7Jul 25, 2026 18:3910,857100,646,43976,679,00013,439,00035,667,968
8Jul 25, 2026 18:3910,894100,330,67676,111,00014,314,00037,765,120
9Jul 25, 2026 18:3911,134102,362,65776,476,00015,942,00035,667,968