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 listMar 3, 2025 12:31Paul KhadimPaul KhadimScore: 90,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2025 12:3190,780779,609,100694,516,00058,958,0002,277,376
2Mar 3, 2025 12:3190,783783,287,843691,542,00061,959,0002,289,664
3Mar 3, 2025 12:3190,810779,045,664690,750,00062,977,0002,277,376
4Mar 3, 2025 12:3190,824776,230,722679,855,00073,984,0002,289,664
5Mar 3, 2025 12:3190,835776,234,110689,939,00063,994,0002,289,664
6Mar 3, 2025 12:3190,840779,806,609694,976,00058,998,0002,506,752
7Mar 3, 2025 12:3190,859786,656,800683,119,00071,012,0002,506,752
8Mar 3, 2025 12:3190,889779,193,974696,425,00057,952,0002,502,656
9Mar 3, 2025 12:3190,949783,497,888691,886,00062,989,0002,506,752