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 listMar 5, 2025 07:59Paul KhadimPaul KhadimScore: 48,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2025 07:5948,165423,209,847396,772,0002,998,0002,277,376
2Mar 5, 2025 07:5948,178431,181,918396,881,0002,999,0002,277,376
3Mar 5, 2025 07:5948,187425,019,947398,949,000999,0002,269,184
4Mar 5, 2025 07:5948,187423,539,905396,952,0002,999,0002,281,472
5Mar 5, 2025 07:5948,190424,354,144396,981,0002,999,0002,281,472
6Mar 5, 2025 07:5948,198431,324,332399,046,0001,000,0002,277,376
7Mar 5, 2025 07:5948,198425,328,521399,047,0001,000,0002,269,184
8Mar 5, 2025 07:5948,208422,579,575398,125,0002,000,0002,273,280
9Mar 5, 2025 07:5948,210430,201,149399,141,0001,000,0002,519,040