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 listFeb 12, 2025 00:12Miguel Rodrigues Carrilho BorgesMiguel Rodrigues Carrilho BorgesScore: 80,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2025 00:1280,546702,359,744667,535,0001,000,0002,269,184
2Feb 12, 2025 00:1280,555693,909,502666,607,0001,998,0002,273,280
3Feb 12, 2025 00:1280,574691,514,794666,763,0001,999,0002,371,584
4Feb 12, 2025 00:1280,576688,148,687666,784,0001,999,0002,281,472
5Feb 12, 2025 00:1280,580692,939,536667,813,000999,0002,289,664
6Feb 12, 2025 00:1280,599691,643,223666,970,0001,999,0002,289,664
7Feb 12, 2025 00:1280,609693,370,436666,055,0003,000,0002,281,472
8Feb 12, 2025 00:1280,630695,612,424668,226,0001,000,0002,289,664
9Feb 12, 2025 00:1280,630697,793,880668,228,0001,000,0002,289,664