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 listAug 31, 2026 01:24Josu San MartinJosu San MartinScore: 5,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 01:335,81156,637,66847,199,0001,039,0002,113,536
2Aug 31, 2026 01:335,81156,716,49547,195,0001,038,0002,113,536
3Aug 31, 2026 01:335,81556,705,38547,228,0001,044,0002,113,536
4Aug 31, 2026 01:335,82256,769,67847,278,0001,045,0002,113,536
5Aug 31, 2026 01:335,82656,816,15347,322,0001,042,0002,113,536
6Aug 31, 2026 01:335,82856,824,31647,369,0001,006,0002,113,536
7Aug 31, 2026 01:335,83356,668,40147,300,0001,120,0002,113,536
8Aug 31, 2026 01:335,83756,865,91147,340,0001,109,0002,113,536
9Aug 31, 2026 01:335,85857,026,45047,589,0001,033,0002,113,536