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 listJun 4, 2025 05:54Abhigyan NiranjanAbhigyan NiranjanScore: 2,065,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 05:542,064,56617,169,249,30317,074,926,00060,974,0002,277,376
2Jun 4, 2025 05:542,064,73917,175,195,26917,080,353,00056,977,0002,289,664
3Jun 4, 2025 05:542,065,35617,178,514,13717,071,488,00070,968,0002,277,376
4Jun 4, 2025 05:542,065,38017,178,857,46017,088,683,00053,973,0002,277,376
5Jun 4, 2025 05:542,065,69617,181,944,02817,078,301,00066,973,0002,285,568
6Jun 4, 2025 05:542,065,86017,177,927,99017,072,673,00073,968,0002,277,376
7Jun 4, 2025 05:542,067,70917,193,270,23517,090,020,00071,966,0002,289,664
8Jun 4, 2025 05:542,084,22017,333,416,72317,252,044,00046,978,0002,277,376
9Jun 4, 2025 05:542,171,42218,053,028,27317,947,835,00074,970,0002,277,376