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 10:03wnwnScore: 3,413Success
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 10:033,38141,555,60127,014,0001,052,0002,482,176
2May 10, 2026 10:033,38244,324,24127,023,0001,055,0002,490,368
3May 10, 2026 10:033,39743,527,99827,121,0001,075,0002,482,176
4May 10, 2026 10:033,40741,251,27827,204,0001,075,0002,490,368
5May 10, 2026 10:033,41342,177,88227,288,0001,042,0002,490,368
6May 10, 2026 10:033,43144,665,34627,397,0001,085,0002,486,272
7May 10, 2026 10:033,54446,419,37728,339,0001,082,0002,478,080
8May 10, 2026 10:033,56844,059,46628,564,0001,057,0002,482,176
9May 10, 2026 10:033,57043,770,23528,570,0001,064,0002,490,368