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 listJan 20, 2025 22:40Cameron AavikCameron AavikScore: 34,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2025 22:4034,116308,150,351223,126,00060,034,0002,400,256
2Jan 20, 2025 22:4034,189309,718,825224,816,00058,951,0002,535,424
3Jan 20, 2025 22:4034,201310,198,485221,895,00061,970,0002,535,424
4Jan 20, 2025 22:4034,295304,297,622219,731,00064,920,0002,535,424
5Jan 20, 2025 22:4034,296316,029,726231,720,00052,936,0002,293,760
6Jan 20, 2025 22:4034,505313,292,099233,319,00053,072,0002,301,952
7Jan 20, 2025 22:4034,617313,796,880240,271,00047,053,0002,535,424
8Jan 20, 2025 22:4034,635313,139,377211,348,00076,125,0002,314,240
9Jan 20, 2025 22:4034,666319,955,228219,792,00067,935,0002,539,520