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 listSep 17, 2026 16:25Andrew EpsteinAndrew EpsteinScore: 9,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 16:369,72189,414,61379,652,0001,040,0002,117,632stderr
2Sep 17, 2026 16:369,79290,047,52580,240,0001,038,0002,117,632stderr
3Sep 17, 2026 16:369,80490,125,74980,295,0001,079,0002,117,632stderr
4Sep 17, 2026 16:369,80890,676,66080,362,0001,048,0002,117,632stderr
5Sep 17, 2026 16:369,84090,968,75180,635,0001,044,0002,117,632stderr
6Sep 17, 2026 16:369,84590,418,79880,651,0001,066,0002,117,632stderr
7Sep 17, 2026 16:369,85490,549,74080,743,0001,053,0002,117,632stderr
8Sep 17, 2026 16:369,85591,816,33380,726,0001,073,0002,117,632stderr
9Sep 17, 2026 16:369,88996,369,89980,950,0001,129,0002,117,632stderr