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 5, 2026 16:33M-RochatM-RochatScore: 19,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 16:3419,656177,624,210162,015,0001,135,0002,469,888
2May 5, 2026 16:3419,715179,570,223162,482,0001,158,0002,473,984
3May 5, 2026 16:3419,801182,954,640163,174,0001,182,0002,473,984
4May 5, 2026 16:3419,806179,185,377163,237,0001,155,0002,469,888
5May 5, 2026 16:3419,855181,950,429163,603,0001,199,0002,461,696
6May 5, 2026 16:3419,867182,667,791163,743,0001,158,0002,469,888
7May 5, 2026 16:3419,925181,923,348164,207,0001,178,0002,469,888
8May 5, 2026 16:3419,980185,959,812164,686,0001,153,0002,482,176
9May 5, 2026 16:3420,194184,171,705166,474,0001,137,0002,469,888