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 listApr 10, 2026 18:27Gustas RoveGustas RoveScore: 2,069,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 18:272,063,52917,162,733,52917,054,326,00072,967,0002,281,472
2Apr 10, 2026 18:272,066,41417,180,844,69017,079,262,00071,971,0002,289,664
3Apr 10, 2026 18:272,066,60717,190,242,94417,090,870,00061,970,0002,355,200
4Apr 10, 2026 18:272,068,05717,194,829,27117,096,902,00067,967,0002,281,472
5Apr 10, 2026 18:272,069,06517,209,219,51817,105,270,00067,969,0002,293,760
6Apr 10, 2026 18:272,070,26417,221,141,91017,112,226,00070,967,0002,293,760
7Apr 10, 2026 18:272,071,40417,227,514,75717,109,687,00082,964,0002,289,664
8Apr 10, 2026 18:272,072,18217,242,218,48417,128,145,00070,967,0002,289,664
9Apr 10, 2026 18:272,244,68518,667,763,64818,556,920,00073,967,0002,281,472