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 listDec 21, 2025 16:51jhallgreenjhallgreenScore: 68,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 16:5168,194592,037,770510,009,00056,001,0002,519,040
2Dec 21, 2025 16:5168,198592,030,839508,036,00058,004,0002,519,040
3Dec 21, 2025 16:5168,232594,372,712506,293,00060,034,0002,510,848
4Dec 21, 2025 16:5168,308590,187,318510,962,00055,995,0002,326,528
5Dec 21, 2025 16:5168,316589,821,822521,024,00046,002,0002,330,624
6Dec 21, 2025 16:5168,318594,911,589513,036,00054,003,0002,523,136
7Dec 21, 2025 16:5168,427596,570,164519,949,00047,995,0002,519,040
8Dec 21, 2025 16:5168,518603,153,629520,724,00047,974,0002,330,624
9Dec 21, 2025 16:5168,592598,912,516504,281,00065,036,0002,519,040