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 listJan 23, 2025 11:11Cameron AavikCameron AavikScore: 21,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 11:1121,807206,306,989122,997,00057,998,0002,494,464
2Jan 23, 2025 11:1121,847209,876,594113,207,00068,124,0002,547,712
3Jan 23, 2025 11:1121,866205,424,018127,340,00054,144,0002,482,176
4Jan 23, 2025 11:1121,881212,595,734126,427,00055,186,0002,478,080
5Jan 23, 2025 11:1121,925208,074,260120,984,00060,992,0002,490,368
6Jan 23, 2025 11:1121,972207,117,758126,252,00056,112,0002,469,888
7Jan 23, 2025 11:1122,021213,766,611125,845,00056,930,0002,490,368
8Jan 23, 2025 11:1122,038215,912,911128,942,00053,975,0002,289,664
9Jan 23, 2025 11:1122,086207,181,50696,164,00087,149,0002,535,424