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 18, 2026 21:57Serhii SakhnoSerhii SakhnoScore: 370,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 21:57368,5733,088,438,6952,993,197,00065,960,0002,285,568
2Feb 18, 2026 21:57368,7253,084,600,6132,979,457,00080,958,0002,293,760
3Feb 18, 2026 21:57368,8963,094,217,0652,990,864,00070,973,0002,293,760
4Feb 18, 2026 21:57369,7483,093,071,6322,990,938,00077,972,0002,293,760
5Feb 18, 2026 21:57370,7673,102,005,9033,013,398,00063,966,0002,363,392
6Feb 18, 2026 21:57371,8523,112,465,1663,025,404,00060,967,0002,285,568
7Feb 18, 2026 21:57372,1833,120,846,7123,027,161,00061,962,0002,285,568
8Feb 18, 2026 21:57393,2983,286,536,8783,211,402,00052,973,0002,293,760
9Feb 18, 2026 21:57403,9133,376,886,4543,285,507,00066,969,0002,359,296