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 listMay 9, 2026 14:15wnwnScore: 3,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 14:153,36344,177,16326,860,0001,056,0002,486,272
2May 9, 2026 14:153,39946,364,63527,108,0001,109,0002,486,272
3May 9, 2026 14:153,41043,850,53327,214,0001,090,0002,478,080
4May 9, 2026 14:153,47743,635,27727,808,0001,058,0002,482,176
5May 9, 2026 14:153,52944,131,10628,234,0001,061,0002,490,368
6May 9, 2026 14:153,54643,665,61028,299,0001,141,0002,490,368
7May 9, 2026 14:153,55748,038,95028,433,0001,093,0002,486,272
8May 9, 2026 14:153,57544,279,25828,627,0001,051,0002,478,080
9May 9, 2026 14:153,57745,255,04728,607,0001,086,0002,473,984