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 listMay 8, 2025 02:18brunomascalibrunomascaliScore: 2,070,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2025 02:182,063,60917,165,663,52117,059,984,00067,972,0002,285,568
2May 8, 2025 02:182,066,25917,192,139,73617,080,984,00068,963,0002,277,376
3May 8, 2025 02:182,067,03917,191,913,47617,091,449,00064,971,0002,285,568
4May 8, 2025 02:182,068,37517,204,891,69117,105,535,00061,976,0002,277,376
5May 8, 2025 02:182,070,09517,223,471,17717,125,814,00055,973,0002,277,376
6May 8, 2025 02:182,071,53517,232,338,57917,127,766,00065,972,0002,289,664
7May 8, 2025 02:182,072,85617,243,646,95517,150,724,00053,977,0002,519,040
8May 8, 2025 02:182,084,07317,326,819,30517,233,830,00063,973,0002,289,664
9May 8, 2025 02:182,263,91918,821,099,81318,725,556,00064,974,0002,277,376