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 listFeb 18, 2026 15:47wnwnScore: 6,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 15:476,78980,608,97255,346,0001,006,0002,281,472
2Feb 18, 2026 15:476,80677,593,39356,486,00002,281,472
3Feb 18, 2026 15:476,81283,405,98555,532,0001,009,0002,281,472
4Feb 18, 2026 15:476,82284,046,64856,620,00002,281,472
5Feb 18, 2026 15:476,87581,301,13055,057,0002,002,0002,281,472
6Feb 18, 2026 15:476,88480,611,79856,137,0001,002,0002,281,472
7Feb 18, 2026 15:476,91379,002,64157,376,00002,457,600
8Feb 18, 2026 15:476,92479,581,07856,463,0001,008,0002,281,472
9Feb 18, 2026 15:476,96890,772,65155,842,0001,994,0002,281,472