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 16, 2026 18:47e1011e1011Score: 53,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:4852,948450,469,517438,241,0001,232,0002,113,536
2Oct 16, 2026 18:4853,193452,804,385440,498,0001,004,0002,113,536
3Oct 16, 2026 18:4853,451454,600,300442,642,0001,005,0002,113,536
4Oct 16, 2026 18:4853,889458,187,963446,028,0001,255,0002,113,536
5Oct 16, 2026 18:4853,900458,404,104446,119,0001,254,0002,113,536
6Oct 16, 2026 18:4853,913458,845,408446,229,0001,251,0002,113,536
7Oct 16, 2026 18:4853,919458,368,277446,529,0001,002,0002,113,536
8Oct 16, 2026 18:4853,920458,857,261446,535,0001,002,0002,113,536
9Oct 16, 2026 18:4853,955458,763,482446,825,0001,002,0002,113,536