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 10, 2026 01:31Josu San MartinJosu San MartinScore: 4,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 10, 2026 01:314,70454,208,93637,991,0001,055,0002,473,984
2May 10, 2026 01:314,75054,438,86738,252,0001,178,0002,478,080
3May 10, 2026 01:314,80257,726,47538,771,0001,091,0002,465,792
4May 10, 2026 01:314,81357,168,13338,862,0001,086,0002,478,080
5May 10, 2026 01:314,87058,691,60739,226,0001,200,0002,469,888
6May 10, 2026 01:314,96553,751,52240,102,0001,114,0002,473,984
7May 10, 2026 01:315,09357,141,06241,199,0001,081,0002,473,984
8May 10, 2026 01:315,16757,505,70341,713,0001,174,0002,465,792
9May 10, 2026 01:315,27757,910,29442,735,0001,069,0002,469,888