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 21:29CheranMahalingamCheranMahalingamScore: 1,828,864Success
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 21:291,821,45515,150,828,20315,042,107,00075,970,0002,281,472
2Nov 5, 2024 21:291,821,74615,158,125,64215,055,519,00064,972,0002,281,472
3Nov 5, 2024 21:291,827,86815,210,927,22415,088,342,00082,963,0002,281,472
4Nov 5, 2024 21:291,828,30415,213,291,65815,117,951,00056,973,0002,281,472
5Nov 5, 2024 21:291,828,86415,213,897,14415,097,604,00081,965,0002,293,760
6Nov 5, 2024 21:291,828,88915,216,660,19115,107,808,00071,970,0002,281,472
7Nov 5, 2024 21:291,830,28315,219,631,26715,124,383,00066,970,0002,281,472
8Nov 5, 2024 21:291,833,63915,255,881,51715,144,240,00074,966,0002,281,472
9Nov 5, 2024 21:291,874,31115,591,663,68815,499,805,00056,977,0002,281,472