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 listSep 6, 2026 11:18Kevin HeaveyKevin HeaveyScore: 3,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:213,52137,557,49228,051,0001,175,0002,113,536
2Sep 6, 2026 11:213,53237,602,53428,130,0001,189,0002,113,536
3Sep 6, 2026 11:213,54737,745,01528,411,0001,037,0002,113,536
4Sep 6, 2026 11:213,55137,804,91528,437,0001,041,0002,113,536
5Sep 6, 2026 11:213,55137,828,22728,276,0001,198,0002,113,536
6Sep 6, 2026 11:213,60838,258,23828,745,0001,208,0002,113,536
7Sep 6, 2026 11:213,73939,358,28829,825,0001,214,0002,113,536
8Sep 6, 2026 11:213,82840,102,35430,558,0001,222,0002,113,536
9Sep 6, 2026 11:213,83241,626,88530,612,0001,201,0002,113,536