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 24, 2026 21:07Kevin HeaveyKevin HeaveyScore: 3,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 21:123,63140,226,50229,090,0001,048,0002,113,536
2Jul 24, 2026 21:123,63440,358,78929,114,0001,049,0002,113,536
3Jul 24, 2026 21:123,63840,385,81729,033,0001,166,0002,113,536
4Jul 24, 2026 21:123,64140,320,47229,179,0001,048,0002,113,536
5Jul 24, 2026 21:123,64740,373,48329,228,0001,049,0002,113,536
6Jul 24, 2026 21:123,73941,796,78729,984,0001,050,0002,113,536
7Jul 24, 2026 21:123,83142,638,70430,753,0001,046,0002,113,536
8Jul 24, 2026 21:123,88642,406,43731,209,0001,047,0002,113,536
9Jul 24, 2026 21:123,92843,397,81931,561,0001,045,0002,113,536