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 13:51satoru.netsatoru.netScore: 71,935Success
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 13:5171,898620,211,187537,775,00058,975,0002,351,104
2Feb 23, 2026 13:5171,906625,084,362541,839,00054,983,0002,277,376
3Feb 23, 2026 13:5171,908625,855,039540,851,00055,984,0002,347,008
4Feb 23, 2026 13:5171,919618,783,821543,937,00052,993,0002,277,376
5Feb 23, 2026 13:5171,935621,634,477549,053,00048,004,0002,277,376
6Feb 23, 2026 13:5171,940618,604,031545,093,00052,008,0002,277,376
7Feb 23, 2026 13:5171,997628,609,608541,612,00055,959,0002,277,376
8Feb 23, 2026 13:5172,043622,713,615550,963,00046,996,0002,347,008
9Feb 23, 2026 13:5172,104622,186,367540,518,00057,948,0002,277,376