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 listNov 11, 2024 12:24ZOTTIGZOTTIGScore: 86,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 12:2485,941743,014,125643,379,00069,932,0002,297,856
2Nov 11, 2024 12:2485,992743,079,849646,759,00066,975,0002,297,856
3Nov 11, 2024 12:2486,073741,093,100645,464,00068,942,0002,379,776
4Nov 11, 2024 12:2486,265752,911,224650,003,00066,000,0002,330,624
5Nov 11, 2024 12:2486,359745,703,049649,797,00066,979,0002,306,048
6Nov 11, 2024 12:2486,488744,780,805651,867,00065,986,0002,306,048
7Nov 11, 2024 12:2486,835748,554,876653,758,00066,975,0002,322,432
8Nov 11, 2024 12:2487,233752,503,039650,028,00074,003,0002,301,952
9Nov 11, 2024 12:2487,441754,302,094653,786,00071,976,0002,297,856