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 4, 2026 12:38Joel ChongJoel ChongScore: 62,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 12:3961,087516,645,720505,797,0001,227,0002,113,536
2Jul 4, 2026 12:3962,020524,461,623513,771,0001,002,0002,113,536
3Jul 4, 2026 12:3962,041524,567,519513,723,0001,218,0002,113,536
4Jul 4, 2026 12:3962,080524,953,323514,039,0001,228,0002,113,536
5Jul 4, 2026 12:3962,083525,428,562514,293,0001,001,0002,113,536
6Jul 4, 2026 12:3962,098525,074,772514,418,0001,001,0002,113,536
7Jul 4, 2026 12:3962,107525,612,340514,248,0001,247,0002,113,536
8Jul 4, 2026 12:3962,139525,843,775514,526,0001,233,0002,113,536
9Jul 4, 2026 12:3962,145525,654,400514,801,0001,004,0002,113,536