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 18, 2025 08:15Chandrasekaran AkashChandrasekaran AkashScore: 1,827,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 08:151,825,02715,177,582,66215,062,762,00084,959,0002,277,376
2Apr 18, 2025 08:151,825,39115,187,945,39715,064,778,00085,964,0002,523,136
3Apr 18, 2025 08:151,826,02315,185,521,45115,094,017,00061,971,0002,277,376
4Apr 18, 2025 08:151,827,53815,200,890,55515,090,598,00077,966,0002,285,568
5Apr 18, 2025 08:151,827,58915,198,391,32515,081,028,00087,959,0002,277,376
6Apr 18, 2025 08:151,827,79615,206,509,13415,109,735,00060,970,0002,277,376
7Apr 18, 2025 08:151,827,86515,200,687,41515,097,309,00073,967,0002,293,760
8Apr 18, 2025 08:151,831,56315,242,677,39915,126,006,00075,969,0002,293,760
9Apr 18, 2025 08:151,832,01215,239,661,58515,148,720,00056,976,0002,285,568