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 listOct 16, 2025 16:53BenzotoporBenzotoporScore: 218,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2025 16:53217,9001,832,324,7381,717,588,00090,978,0002,277,376
2Oct 16, 2025 16:53217,9731,838,133,5161,733,212,00075,965,0002,265,088
3Oct 16, 2025 16:53217,9871,834,734,6371,737,322,00071,971,0002,277,376
4Oct 16, 2025 16:53218,0161,835,244,0101,739,548,00069,981,0002,285,568
5Oct 16, 2025 16:53218,0211,836,493,8381,743,589,00065,984,0002,277,376
6Oct 16, 2025 16:53218,0331,837,093,4021,735,730,00073,945,0002,289,664
7Oct 16, 2025 16:53218,0451,838,741,0841,740,822,00068,953,0002,277,376
8Oct 16, 2025 16:53218,1331,831,587,8221,743,521,00066,981,0002,277,376
9Oct 16, 2025 16:53218,1351,839,031,7031,736,541,00073,980,0002,277,376