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 9, 2025 21:45pseppsepScore: 48,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 21:4548,087426,130,640397,126,0002,000,0002,273,280
2Dec 9, 2025 21:4548,274434,021,789398,676,0001,998,0002,273,280
3Dec 9, 2025 21:4548,280428,533,701399,723,000999,0002,273,280
4Dec 9, 2025 21:4548,282425,577,845398,746,0001,998,0002,523,136
5Dec 9, 2025 21:4548,293427,403,054398,829,0001,999,0002,273,280
6Dec 9, 2025 21:4548,300426,448,918398,894,0001,999,0002,273,280
7Dec 9, 2025 21:4548,303431,602,838398,912,0001,999,0002,519,040
8Dec 9, 2025 21:4548,305433,020,739397,933,0002,999,0002,273,280
9Dec 9, 2025 21:4548,324427,746,387400,087,0001,000,0002,269,184