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 8, 2025 15:45Dmytro OvcharenkoDmytro OvcharenkoScore: 2,068,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2025 15:452,062,17517,151,669,00217,058,079,00057,976,0002,519,040
2May 8, 2025 15:452,065,93517,175,216,86317,086,288,00060,976,0002,285,568
3May 8, 2025 15:452,066,01717,178,906,51717,093,960,00053,977,0002,277,376
4May 8, 2025 15:452,068,21617,197,308,59717,099,221,00066,969,0002,289,664
5May 8, 2025 15:452,068,23817,203,383,88417,113,400,00052,973,0002,277,376
6May 8, 2025 15:452,070,58417,216,783,10617,119,880,00065,968,0002,277,376
7May 8, 2025 15:452,073,32717,247,849,94817,140,652,00067,966,0002,277,376
8May 8, 2025 15:452,123,01717,655,183,14617,565,071,00055,974,0002,277,376
9May 8, 2025 15:452,129,06817,701,919,06217,594,296,00076,966,0002,277,376