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 25, 2026 18:59Ropi777Ropi777Score: 75,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 18:5974,653646,005,561569,655,00049,969,0002,277,376
2Feb 25, 2026 18:5974,891643,760,105554,639,00066,956,0002,383,872
3Feb 25, 2026 18:5975,003656,634,326566,564,00055,957,0002,277,376
4Feb 25, 2026 18:5975,076644,792,562569,121,00054,011,0002,277,376
5Feb 25, 2026 18:5975,136646,377,760559,665,00063,961,0002,498,560
6Feb 25, 2026 18:5975,157649,848,720581,820,00041,987,0002,506,752
7Feb 25, 2026 18:5975,950660,016,922579,353,00051,031,0002,277,376
8Feb 25, 2026 18:5976,209658,803,306581,573,00050,962,0002,379,776
9Feb 25, 2026 18:5986,963747,643,360661,814,00059,983,0002,273,280