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 listOct 16, 2025 16:42BenzotoporBenzotoporScore: 2,028,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2025 16:422,018,76816,795,572,47616,684,807,00070,965,0002,277,376
2Oct 16, 2025 16:422,019,44416,796,738,06316,681,424,00079,963,0002,277,376
3Oct 16, 2025 16:422,020,22216,803,654,90016,698,879,00068,966,0002,277,376
4Oct 16, 2025 16:422,022,75516,828,839,07316,728,901,00059,967,0002,277,376
5Oct 16, 2025 16:422,028,64416,872,654,42116,765,785,00071,964,0002,277,376
6Oct 16, 2025 16:422,029,79516,878,871,90016,767,335,00079,963,0002,277,376
7Oct 16, 2025 16:422,037,79616,950,587,04116,845,744,00067,966,0002,285,568
8Oct 16, 2025 16:422,049,50417,044,092,50416,944,920,00065,964,0002,265,088
9Oct 16, 2025 16:422,050,60317,052,061,17416,953,040,00066,968,0002,289,664