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 6, 2024 10:06Alexander KosachevAlexander KosachevScore: 1,324,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 10:061,299,26310,817,143,95110,721,909,00061,970,0002,293,760
2Nov 6, 2024 10:061,322,51711,007,792,08610,910,922,00065,969,0002,281,472
3Nov 6, 2024 10:061,322,59311,004,393,80510,906,555,00070,964,0002,281,472
4Nov 6, 2024 10:061,323,30611,013,401,14210,921,465,00061,974,0002,281,472
5Nov 6, 2024 10:061,324,14011,020,555,15510,921,391,00068,970,0002,289,664
6Nov 6, 2024 10:061,324,79311,027,891,83710,927,814,00067,967,0002,281,472
7Nov 6, 2024 10:061,325,16311,032,151,74610,924,891,00073,965,0002,281,472
8Nov 6, 2024 10:061,325,39011,027,875,81510,921,779,00078,962,0002,281,472
9Nov 6, 2024 10:061,326,19311,032,704,12510,928,434,00078,967,0002,281,472