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:19wnwnScore: 3,446Success
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:203,37744,870,78826,031,0002,002,0002,486,272
2Apr 26, 2026 15:203,41140,521,70327,302,0001,011,0002,482,176
3Apr 26, 2026 15:203,41442,160,16327,331,0001,012,0002,478,080
4Apr 26, 2026 15:203,42148,846,53927,382,0001,014,0002,490,368
5Apr 26, 2026 15:203,44640,534,62827,585,0001,021,0002,490,368
6Apr 26, 2026 15:203,44641,750,82227,589,0001,021,0002,490,368
7Apr 26, 2026 15:203,44646,980,23027,584,0001,021,0002,490,368
8Apr 26, 2026 15:203,44644,983,79327,585,0001,021,0002,478,080
9Apr 26, 2026 15:203,46047,378,54426,744,0001,981,0002,482,176