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 4, 2026 21:27olliecrowolliecrowScore: 15,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 21:2815,182142,192,191123,828,0002,189,0002,355,200
2May 4, 2026 21:2815,229142,404,808124,154,0002,252,0002,473,984
3May 4, 2026 21:2815,238144,526,986124,209,0002,267,0002,543,616
4May 4, 2026 21:2815,255143,028,878124,403,0002,215,0002,478,080
5May 4, 2026 21:2815,291143,555,218124,678,0002,241,0002,482,176
6May 4, 2026 21:2815,387144,405,371125,693,0002,024,0002,514,944
7May 4, 2026 21:2815,501145,329,951126,639,0002,021,0002,461,696
8May 4, 2026 21:2815,502145,496,476126,487,0002,185,0002,318,336
9May 4, 2026 21:2815,611146,164,764127,552,0002,024,0002,351,104