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 listJun 29, 2026 11:01Adam FolwarcznyAdam FolwarcznyScore: 23,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 11:0222,929198,196,988187,291,0003,022,0002,121,728stderr
2Jun 29, 2026 11:0222,941198,149,678187,390,0003,025,0002,121,728stderr
3Jun 29, 2026 11:0222,959198,247,721187,547,0003,013,0002,121,728stderr
4Jun 29, 2026 11:0223,033199,229,228188,164,0003,017,0002,121,728stderr
5Jun 29, 2026 11:0223,098199,468,915188,672,0003,042,0002,121,728stderr
6Jun 29, 2026 11:0223,129200,047,161188,907,0003,065,0002,121,728stderr
7Jun 29, 2026 11:0223,154199,875,525188,560,0003,624,0002,121,728stderr
8Jun 29, 2026 11:0223,160199,996,678188,636,0003,593,0002,121,728stderr
9Jun 29, 2026 11:0223,163200,151,836189,214,0003,047,0002,121,728stderr