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 11, 2026 07:02wnwnScore: 3,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:033,29736,464,67426,331,0001,037,0002,113,536
2May 11, 2026 07:033,31034,726,89326,450,0001,029,0002,113,536
3May 11, 2026 07:033,31336,372,63826,459,0001,040,0002,113,536
4May 11, 2026 07:033,31637,204,46626,476,0001,050,0002,113,536
5May 11, 2026 07:033,35135,901,29826,790,0001,025,0002,113,536
6May 11, 2026 07:033,41135,733,39827,311,0001,004,0002,113,536
7May 11, 2026 07:033,47837,382,79027,839,0001,031,0002,113,536
8May 11, 2026 07:033,48039,137,59727,867,0001,022,0002,113,536
9May 11, 2026 07:033,48738,172,69327,914,0001,034,0002,113,536