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 7, 2025 01:17rockyou1337rockyou1337Score: 59,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2025 01:1758,853516,007,477486,477,0002,001,0002,260,992
2Aug 7, 2025 01:1758,947513,192,324488,263,0001,000,0002,273,280
3Aug 7, 2025 01:1759,000520,745,150488,705,000999,0002,269,184
4Aug 7, 2025 01:1759,011517,214,610486,794,0002,998,0002,265,088
5Aug 7, 2025 01:1759,013520,069,719485,812,0003,998,0002,273,280
6Aug 7, 2025 01:1759,016519,871,494487,833,0001,999,0002,265,088
7Aug 7, 2025 01:1759,017516,047,629487,839,0001,999,0002,277,376
8Aug 7, 2025 01:1759,018515,694,807487,853,0001,999,0002,265,088
9Aug 7, 2025 01:1759,028529,391,897486,934,0002,999,0002,277,376