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 1, 2026 08:51limanjun99limanjun99Score: 16,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 08:5216,169149,647,683131,205,0003,004,0002,506,752
2May 1, 2026 08:5216,202154,849,850132,471,0002,007,0002,502,656
3May 1, 2026 08:5216,267156,680,164132,018,0003,000,0002,510,848
4May 1, 2026 08:5216,269154,466,831132,037,0003,000,0002,514,944
5May 1, 2026 08:5216,274156,914,962133,079,0002,001,0002,519,040
6May 1, 2026 08:5216,279154,815,225132,114,0003,002,0002,506,752
7May 1, 2026 08:5216,289155,338,802132,196,0003,004,0002,510,848
8May 1, 2026 08:5216,294152,933,843133,238,0002,003,0002,506,752
9May 1, 2026 08:5216,304152,854,747133,326,0002,004,0002,502,656