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 listApr 26, 2026 15:14wnwnScore: 3,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:143,40946,503,15927,287,0001,010,0002,494,464
2Apr 26, 2026 15:143,40943,204,06527,288,0001,010,0002,490,368
3Apr 26, 2026 15:143,42642,640,21827,427,0001,015,0002,486,272
4Apr 26, 2026 15:143,47648,589,63926,868,0001,990,0002,494,464
5Apr 26, 2026 15:143,53442,820,02528,327,0001,011,0002,478,080
6Apr 26, 2026 15:143,55945,500,05428,526,0001,018,0002,486,272
7Apr 26, 2026 15:143,61146,131,34527,977,0001,998,0002,482,176
8Apr 26, 2026 15:143,61247,596,05727,986,0001,999,0002,330,624
9Apr 26, 2026 15:143,66946,299,95629,443,0001,015,0002,490,368