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 25, 2025 10:34Cameron AavikCameron AavikScore: 17,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 10:3417,444170,841,288121,817,00022,965,0002,461,696
2Jan 25, 2025 10:3417,450172,593,146123,862,00020,976,0002,473,984
3Jan 25, 2025 10:3417,454166,353,884129,882,00014,986,0002,400,256
4Jan 25, 2025 10:3417,474169,742,164126,027,00019,004,0002,482,176
5Jan 25, 2025 10:3417,477169,382,303130,054,00015,006,0002,482,176
6Jan 25, 2025 10:3417,480169,284,666125,074,00020,011,0002,404,352
7Jan 25, 2025 10:3417,487171,626,274130,124,00015,014,0002,473,984
8Jan 25, 2025 10:3417,493168,739,563130,169,00015,019,0002,396,160
9Jan 25, 2025 10:3417,521169,593,280132,390,00013,038,0002,502,656