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 listJun 25, 2025 10:10Valentin KofmanValentin KofmanScore: 6,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 10:106,29173,840,69750,206,0002,008,0002,289,664
2Jun 25, 2025 10:106,29877,576,37450,266,0002,010,0002,273,280
3Jun 25, 2025 10:106,30876,062,82850,347,0002,013,0002,289,664
4Jun 25, 2025 10:106,31575,854,69251,405,0001,007,0002,289,664
5Jun 25, 2025 10:106,31675,008,24551,414,0001,008,0002,269,184
6Jun 25, 2025 10:106,32374,450,52751,471,0001,009,0002,289,664
7Jun 25, 2025 10:106,32677,151,67851,499,0001,009,0002,289,664
8Jun 25, 2025 10:106,34383,551,57451,634,0001,012,0002,289,664
9Jun 25, 2025 10:106,34478,085,01051,646,0001,012,0002,289,664
10Jun 25, 2025 10:108,32890,362,20167,117,0002,003,0002,289,664
11Jun 25, 2025 10:108,33195,802,88767,142,0002,004,0002,273,280
12Jun 25, 2025 10:108,33291,782,61167,148,0002,004,0002,277,376