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 11:40Karthik 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 11:400218,878,807207,645,0002,138,0002,117,632expected "53684724473035369 ", got "H2591 42563 H2564 42564 H2564 42565 H2563 42561 "
2Oct 2, 2026 11:400219,939,012208,879,0002,112,0002,117,632expected "53692357220726852 ", got "H2587 42581 H2580 42581 H2581 42581 H2580 42579 "
3Oct 2, 2026 11:400219,528,687208,475,0002,079,0002,117,632expected "53684142928164779 ", got "H2593 42575 H2574 42576 H2575 42577 H2574 42575 "