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 listOct 2, 2026 18:26Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 18:26042,436,28129,571,0003,850,00020,480expected "53682170153891007 ", got "M1 29355 us s1 "
2Oct 2, 2026 18:26042,180,62729,568,0003,584,00020,480expected "53685460738488184 ", got "M1 29356 us s1 "
3Oct 2, 2026 18:26042,869,76929,841,0004,001,00020,480expected "53685615718354724 ", got "M1 29618 us s0 "