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 15, 2024 21:37Elnur RakhmatullinElnur RakhmatullinScore: 60,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 21:3560,411530,129,803500,408,0001,000,0002,289,664
2Oct 15, 2024 21:3560,471524,426,542458,914,00042,992,0002,281,472
3Oct 15, 2024 21:3560,480525,120,545300,992,000200,995,0002,289,664
4Oct 15, 2024 21:3560,502532,134,647404,137,00098,033,0002,277,376
5Oct 15, 2024 21:3560,518526,228,268372,224,000130,078,0002,281,472
6Oct 15, 2024 21:3760,554529,678,625423,660,00078,936,0002,273,280
7Oct 15, 2024 21:3760,554531,324,089424,660,00077,937,0002,281,472
8Oct 15, 2024 21:3760,655528,312,534436,381,00067,058,0002,281,472
9Oct 15, 2024 21:3560,791535,252,742436,626,00067,941,0002,281,472