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 5, 2024 07:10kauruuskauruusScore: 159,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 07:10159,0921,347,619,7771,232,498,00087,964,0002,326,528
2Nov 5, 2024 07:10159,1631,350,384,7731,223,124,00097,929,0002,326,528
3Nov 5, 2024 07:10159,2451,349,189,5851,225,828,00095,908,0002,330,624
4Nov 5, 2024 07:10159,2561,345,102,0911,229,837,00091,987,0002,326,528
5Nov 5, 2024 07:10159,2561,342,768,1971,222,837,00098,986,0002,330,624
6Nov 5, 2024 07:10159,2851,349,701,0921,241,124,00080,942,0002,326,528
7Nov 5, 2024 07:10159,3271,353,893,2791,233,390,00089,028,0002,326,528
8Nov 5, 2024 07:10159,4071,351,726,3821,225,149,00097,932,0002,326,528
9Nov 5, 2024 07:10159,4421,352,914,2101,227,418,00095,954,0002,482,176