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 7, 2026 23:35Arseni KanapelkaArseni KanapelkaScore: 95,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 23:3594,926807,191,585637,246,000150,643,0002,351,104
2May 7, 2026 23:3594,932805,941,836636,349,000151,587,0002,359,296
3May 7, 2026 23:3595,147805,455,161637,842,000151,879,0002,355,200
4May 7, 2026 23:3595,190807,023,806635,709,000154,370,0002,359,296
5May 7, 2026 23:3595,192807,853,852635,345,000154,753,0002,355,200
6May 7, 2026 23:3595,335809,909,050636,334,000154,952,0002,371,584
7May 7, 2026 23:3595,388808,783,511637,154,000154,568,0002,527,232
8May 7, 2026 23:3595,534810,859,270637,624,000155,310,0002,363,392
9May 7, 2026 23:3595,559808,721,276638,036,000155,104,0002,363,392