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 18, 2025 21:15Adam FolwarcznyAdam FolwarcznyScore: 40,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 21:1540,676363,929,548336,614,000998,0002,260,992
2Aug 18, 2025 21:1540,683367,642,923336,668,000999,0002,260,992
3Aug 18, 2025 21:1540,737367,670,569336,119,0002,000,0002,375,680
4Aug 18, 2025 21:1540,739366,100,374337,135,0001,000,0002,375,680
5Aug 18, 2025 21:1540,741361,218,012336,153,0002,000,0002,260,992
6Aug 18, 2025 21:1540,747359,949,309337,204,0001,000,0002,260,992
7Aug 18, 2025 21:1540,785372,581,707337,518,0001,001,0002,383,872
8Aug 18, 2025 21:1540,804368,064,184337,673,000999,0002,519,040
9Aug 18, 2025 21:1540,838364,073,812336,957,0001,999,0002,392,064