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 17, 2026 04:41Kevin HeaveyKevin HeaveyScore: 3,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 04:473,65741,506,39229,314,0001,044,0002,113,536
2Jul 17, 2026 04:473,67140,240,86229,418,0001,052,0002,113,536
3Jul 17, 2026 04:473,70642,520,82729,715,0001,048,0002,113,536
4Jul 17, 2026 04:473,70840,672,13829,734,0001,049,0002,113,536
5Jul 17, 2026 04:473,75542,329,33030,120,0001,047,0002,113,536
6Jul 17, 2026 04:473,80141,368,94430,506,0001,044,0002,113,536
7Jul 17, 2026 04:473,90842,406,26331,304,0001,134,0002,113,536
8Jul 17, 2026 04:473,96142,790,94031,837,0001,044,0002,113,536
9Jul 17, 2026 04:474,03244,749,99832,424,0001,043,0002,113,536