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 24, 2025 16:41HighFreqBanditHighFreqBanditScore: 112,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2025 16:41112,170962,263,323929,013,0001,997,0002,289,664
2Feb 24, 2025 16:41112,172955,134,577931,031,00002,269,184
3Feb 24, 2025 16:41112,200962,454,134930,263,000999,0002,289,664
4Feb 24, 2025 16:41112,203961,306,693929,288,0001,998,0002,269,184
5Feb 24, 2025 16:41112,221960,033,177929,435,0001,998,0002,273,280
6Feb 24, 2025 16:41112,224955,328,806929,465,0001,998,0002,265,088
7Feb 24, 2025 16:41112,367958,185,832930,647,0001,999,0002,289,664
8Feb 24, 2025 16:41112,473958,258,419930,525,0002,998,0002,289,664
9Feb 24, 2025 16:41112,486957,759,219931,632,0001,999,0002,281,472