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 listFeb 26, 2026 12:25Genos0Genos0Score: 75,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 12:2575,647652,799,497509,892,000117,975,0002,383,872
2Feb 26, 2026 12:2575,734651,790,921535,653,00092,939,0002,277,376
3Feb 26, 2026 12:2575,737651,010,809549,669,00078,952,0002,277,376
4Feb 26, 2026 12:2575,751654,002,432547,766,00080,965,0002,277,376
5Feb 26, 2026 12:2575,790662,956,589556,054,00073,007,0002,289,664
6Feb 26, 2026 12:2575,823655,929,748560,402,00068,926,0002,375,680
7Feb 26, 2026 12:2575,830654,255,548559,458,00069,932,0002,277,376
8Feb 26, 2026 12:2575,835656,812,983564,493,00064,941,0002,375,680
9Feb 26, 2026 12:2575,995652,016,442549,792,00080,969,0002,277,376