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 listSep 3, 2026 04:25CheckHarryCheckHarryScore: 9,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:279,73090,758,53879,720,0001,047,0002,113,536
2Sep 3, 2026 04:279,75190,868,04679,903,0001,037,0002,113,536
3Sep 3, 2026 04:279,75690,858,21479,935,0001,043,0002,113,536
4Sep 3, 2026 04:279,77491,025,83380,078,0001,052,0002,113,536
5Sep 3, 2026 04:279,78591,071,59580,167,0001,053,0002,113,536
6Sep 3, 2026 04:279,79091,097,57680,224,0001,038,0002,113,536
7Sep 3, 2026 04:279,80191,284,38580,300,0001,051,0002,113,536
8Sep 3, 2026 04:279,87691,789,62780,936,0001,041,0002,113,536
9Sep 3, 2026 04:279,88591,896,58781,047,0001,004,0002,113,536