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 21, 2025 20:23Adam FolwarcznyAdam FolwarcznyScore: 19,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 20:2319,243182,715,311157,724,0001,996,0002,269,184
2Aug 21, 2025 20:2319,246197,552,912158,741,000998,0002,441,216
3Aug 21, 2025 20:2319,248184,895,577157,760,0001,996,0002,531,328
4Aug 21, 2025 20:2319,252184,088,822157,797,0001,997,0002,531,328
5Aug 21, 2025 20:2319,262178,990,546157,879,0001,998,0002,441,216
6Aug 21, 2025 20:2319,262188,303,772157,875,0001,998,0002,441,216
7Aug 21, 2025 20:2319,265179,256,436157,898,0001,998,0002,433,024
8Aug 21, 2025 20:2319,270186,169,704157,940,0001,999,0002,445,312
9Aug 21, 2025 20:2319,284183,990,965158,060,0002,000,0002,531,328