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 listOct 24, 2025 07:39Rashin SergeyRashin SergeyScore: 54,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2025 07:3954,715476,341,281452,133,0002,000,0002,260,992
2Oct 24, 2025 07:3954,723480,614,969452,197,0002,000,0002,273,280
3Oct 24, 2025 07:3954,742487,126,182451,355,0003,002,0002,273,280
4Oct 24, 2025 07:3954,755482,872,346453,463,0001,001,0002,519,040
5Oct 24, 2025 07:3954,770484,748,936451,590,0002,997,0002,273,280
6Oct 24, 2025 07:3954,770481,265,508452,594,0001,998,0002,273,280
7Oct 24, 2025 07:3954,789480,462,444451,747,0002,998,0002,265,088
8Oct 24, 2025 07:3954,808480,921,708451,910,0002,999,0002,273,280
9Oct 24, 2025 07:3954,812485,143,594452,942,0001,999,0002,273,280