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 29, 2025 12:37GabriellaGabriellaScore: 528,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2025 12:37528,5874,418,791,3104,303,321,00083,947,0002,277,376
2May 29, 2025 12:37528,6844,412,084,5914,311,126,00076,948,0002,289,664
3May 29, 2025 12:37528,7374,414,162,1894,315,561,00072,958,0002,277,376
4May 29, 2025 12:37528,7654,419,479,7394,326,792,00061,954,0002,498,560
5May 29, 2025 12:37528,7714,418,216,7914,333,825,00054,972,0002,277,376
6May 29, 2025 12:37528,8234,413,643,6364,332,254,00056,977,0002,277,376
7May 29, 2025 12:37528,8924,420,110,1974,324,833,00064,967,0002,502,656
8May 29, 2025 12:37529,0014,425,597,4764,338,735,00051,972,0002,506,752
9May 29, 2025 12:37529,0094,423,537,9294,321,807,00068,965,0002,326,528