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 4, 2026 07:34limanjun99limanjun99Score: 5,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 07:345,80464,416,96545,910,0002,268,0002,494,464
2May 4, 2026 07:345,82666,241,62045,087,0003,269,0002,486,272
3May 4, 2026 07:345,83964,058,88946,131,0002,338,0002,519,040
4May 4, 2026 07:345,84163,982,17845,170,0003,317,0002,506,752
5May 4, 2026 07:345,88266,177,11645,563,0003,261,0002,498,560
6May 4, 2026 07:345,89564,138,20645,674,0003,256,0002,502,656
7May 4, 2026 07:345,90166,233,40845,892,0003,089,0002,498,560
8May 4, 2026 07:345,94366,095,44146,232,0003,098,0002,506,752
9May 4, 2026 07:346,09367,001,95947,425,0003,152,0002,498,560