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 29, 2025 08:00Adam FolwarcznyAdam FolwarcznyScore: 10,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2025 08:0010,589110,908,92750,364,00037,526,0002,433,024
2Aug 29, 2025 08:0010,643120,595,53350,057,00038,278,0002,478,080
3Aug 29, 2025 08:0010,703119,800,91747,378,00041,456,0002,437,120
4Aug 29, 2025 08:0010,783116,879,80650,157,00039,339,0002,428,928
5Aug 29, 2025 08:0010,835115,703,35252,379,00037,554,0002,428,928
6Aug 29, 2025 08:0011,097117,772,47353,482,00038,625,0002,437,120