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 00:51zielajzielajScore: 6,168Success
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 00:516,07472,969,21749,410,0001,008,0002,273,280
2Nov 11, 2024 00:516,08671,587,07450,514,00002,273,280
3Nov 11, 2024 00:516,08977,666,09950,539,00002,535,424
4Nov 11, 2024 00:516,09173,017,55650,555,00002,273,280
5Nov 11, 2024 00:516,09776,690,71849,592,0001,012,0002,535,424
6Nov 11, 2024 00:516,14178,091,63448,970,0001,998,0002,273,280
7Nov 11, 2024 00:516,16876,069,52149,190,0002,007,0002,273,280
8Nov 11, 2024 00:516,33179,407,00552,549,00002,535,424
9Nov 11, 2024 00:516,33782,005,22251,587,0001,011,0002,535,424
10Nov 11, 2024 00:517,48384,177,00261,105,0001,001,0002,424,832
11Nov 11, 2024 00:517,51479,906,99762,370,00002,269,184
12Nov 11, 2024 00:517,54191,463,13262,590,00002,269,184