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 17, 2026 20:07Kevin HeaveyKevin HeaveyScore: 3,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 20:153,68540,392,78929,550,0001,043,0002,113,536
2Jul 17, 2026 20:153,70840,702,43029,733,0001,047,0002,113,536
3Jul 17, 2026 20:153,71140,660,55729,753,0001,050,0002,113,536
4Jul 17, 2026 20:153,71149,585,28129,756,0001,050,0002,113,536
5Jul 17, 2026 20:153,71650,809,55029,801,0001,048,0002,113,536
6Jul 17, 2026 20:153,76841,107,32630,231,0001,048,0002,113,536
7Jul 17, 2026 20:153,77552,852,30030,292,0001,047,0002,113,536
8Jul 17, 2026 20:153,97942,904,81931,982,0001,045,0002,113,536
9Jul 17, 2026 20:154,06344,170,60132,685,0001,042,0002,113,536