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 01:23Miguel Rodrigues Carrilho BorgesMiguel Rodrigues Carrilho BorgesScore: 79,135Success
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 01:2379,039678,585,426654,023,0002,000,0002,273,280
2Feb 12, 2025 01:2379,060684,473,653655,196,0001,000,0002,289,664
3Feb 12, 2025 01:2379,114685,855,161654,648,0001,998,0002,265,088
4Feb 12, 2025 01:2379,121680,454,056654,702,0001,999,0002,289,664
5Feb 12, 2025 01:2379,135684,797,037654,823,0001,999,0002,269,184
6Feb 12, 2025 01:2379,165684,121,123656,069,0001,000,0002,289,664
7Feb 12, 2025 01:2379,168683,250,063655,091,0002,000,0002,273,280
8Feb 12, 2025 01:2379,175685,214,439655,155,0002,000,0002,281,472
9Feb 12, 2025 01:2379,177680,714,406655,170,0002,000,0002,273,280