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 listAug 19, 2025 08:17Ashish AhujaAshish AhujaScore: 10,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2025 08:1710,367106,430,27779,045,0007,004,0002,437,120
2Aug 19, 2025 08:1710,384112,602,85780,177,0006,013,0002,281,472
3Aug 19, 2025 08:1710,393110,562,59480,246,0006,018,0002,392,064
4Aug 19, 2025 08:1710,424116,201,98081,546,0004,972,0002,293,760
5Aug 19, 2025 08:1710,425113,884,83082,546,0003,978,0002,420,736
6Aug 19, 2025 08:1710,441111,396,67979,691,0006,973,0002,375,680
7Aug 19, 2025 08:1710,447117,276,90578,733,0007,973,0002,289,664
8Aug 19, 2025 08:1710,473112,618,47480,935,0005,995,0002,404,352
9Aug 19, 2025 08:1710,483111,383,38479,009,0008,000,0002,293,760
10Aug 19, 2025 08:1710,486110,231,82181,033,0006,002,0002,404,352
11Aug 19, 2025 08:1710,634116,224,11781,241,0007,020,0002,289,664
12Aug 19, 2025 08:1710,750119,370,83183,207,0006,015,0002,285,568