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 20, 2026 10:41Victor MerckléVictor MerckléScore: 5,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:425,70355,192,38046,318,0001,024,0002,113,536
2May 20, 2026 10:425,70856,896,02746,354,0001,028,0002,113,536
3May 20, 2026 10:425,82256,331,36847,304,0001,021,0002,113,536
4May 20, 2026 10:425,86656,596,33947,647,0001,043,0002,113,536
5May 20, 2026 10:425,87058,268,73247,713,0001,013,0002,113,536
6May 20, 2026 10:425,88256,700,89847,791,0001,034,0002,113,536
7May 20, 2026 10:425,88956,743,15347,768,0001,112,0002,113,536
8May 20, 2026 10:425,90559,464,37547,981,0001,035,0002,113,536
9May 20, 2026 10:425,91057,920,33848,018,0001,037,0002,113,536