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 listOct 13, 2026 06:39e1011e1011Score: 57,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 06:3957,702489,549,312424,381,00054,548,0002,113,536
2Oct 13, 2026 06:3957,741489,836,890423,659,00055,596,0002,113,536
3Oct 13, 2026 06:3957,748492,004,112423,677,00055,635,0002,113,536
4Oct 13, 2026 06:3957,757490,627,149423,644,00055,743,0002,113,536
5Oct 13, 2026 06:3957,787490,151,784424,135,00055,498,0002,113,536
6Oct 13, 2026 06:3957,787490,280,419424,003,00055,631,0002,113,536
7Oct 13, 2026 06:3957,799491,058,769424,344,00055,393,0002,113,536
8Oct 13, 2026 06:3957,802491,056,307424,344,00055,419,0002,113,536
9Oct 13, 2026 06:3957,809491,101,537424,291,00055,526,0002,117,632