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 18, 2025 11:24AlexAlexScore: 53,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2025 11:2453,440471,038,957440,552,0002,996,0002,277,376
2Feb 18, 2025 11:2453,456469,859,730441,688,0001,998,0002,355,200
3Feb 18, 2025 11:2453,465466,732,859441,759,0001,998,0002,277,376
4Feb 18, 2025 11:2453,474466,939,243441,834,0001,999,0002,281,472
5Feb 18, 2025 11:2453,482466,808,764442,905,000999,0002,277,376
6Feb 18, 2025 11:2453,497471,989,912442,027,0002,000,0002,277,376
7Feb 18, 2025 11:2453,499467,269,243443,044,0001,000,0002,265,088
8Feb 18, 2025 11:2453,526466,236,520443,263,0001,000,0002,408,448
9Feb 18, 2025 11:2453,535471,822,911443,338,0001,000,0002,265,088