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 listFeb 23, 2026 16:01satoru.netsatoru.netScore: 38,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 16:0138,245344,189,465317,433,00002,514,944
2Feb 23, 2026 16:0138,258348,205,960315,544,0001,997,0002,277,376
3Feb 23, 2026 16:0138,267343,644,262316,620,000998,0002,277,376
4Feb 23, 2026 16:0138,267342,053,660316,617,000998,0002,396,160
5Feb 23, 2026 16:0138,268350,018,326315,630,0001,997,0002,277,376
6Feb 23, 2026 16:0138,273347,352,576315,670,0001,997,0002,277,376
7Feb 23, 2026 16:0138,284349,036,240315,757,0001,998,0002,277,376
8Feb 23, 2026 16:0138,287348,120,247316,779,000999,0002,400,256
9Feb 23, 2026 16:0138,298342,221,903315,873,0001,999,0002,277,376