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 20, 2026 18:15Daniel MastalerzDaniel MastalerzScore: 5,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 18:155,76172,582,24144,825,0002,988,0002,314,240
2Feb 20, 2026 18:155,76473,011,18543,856,0003,986,0002,523,136
3Feb 20, 2026 18:155,76974,183,93044,893,0002,992,0002,326,528
4Feb 20, 2026 18:155,85082,369,38845,520,0003,034,0002,273,280
5Feb 20, 2026 18:155,88272,161,55345,834,0002,989,0002,519,040
6Feb 20, 2026 18:156,00773,983,41346,866,0002,991,0002,297,856