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 22, 2025 21:15Adam FolwarcznyAdam FolwarcznyScore: 17,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 21:1517,097166,972,947139,911,0001,998,0002,269,184
2Aug 22, 2025 21:1517,099162,793,164139,921,0001,998,0002,531,328
3Aug 22, 2025 21:1517,099162,360,979139,924,0001,998,0002,531,328
4Aug 22, 2025 21:1517,099164,255,652139,925,0001,998,0002,531,328
5Aug 22, 2025 21:1517,100162,780,174139,933,0001,999,0002,433,024
6Aug 22, 2025 21:1517,100161,471,158139,931,0001,999,0002,441,216
7Aug 22, 2025 21:1517,102163,578,145139,950,0001,999,0002,445,312
8Aug 22, 2025 21:1517,102161,759,833139,944,0001,999,0002,531,328
9Aug 22, 2025 21:1517,103167,293,877139,960,0001,999,0002,531,328