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 5, 2026 20:42Kevin HeaveyKevin HeaveyScore: 5,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:435,08951,796,32541,062,0001,180,0002,117,632
2Jul 5, 2026 20:435,16352,392,62841,683,0001,177,0002,117,632
3Jul 5, 2026 20:435,16652,456,64241,716,0001,165,0002,117,632
4Jul 5, 2026 20:435,17252,426,64341,773,0001,159,0002,117,632
5Jul 5, 2026 20:435,17352,502,35441,911,0001,033,0002,117,632
6Jul 5, 2026 20:435,21052,838,98342,073,0001,178,0002,117,632
7Jul 5, 2026 20:435,22352,907,84442,113,0001,239,0002,117,632
8Jul 5, 2026 20:435,25153,180,07742,333,0001,252,0002,117,632
9Jul 5, 2026 20:435,27253,306,58642,560,0001,202,0002,117,632