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 2, 2026 17:41CheckHarryCheckHarryScore: 70,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 17:4170,384594,021,249583,144,0001,047,0002,113,536
2Sep 2, 2026 17:4170,492596,365,194583,969,0001,117,0002,113,536
3Sep 2, 2026 17:4170,530595,462,422584,277,0001,126,0002,113,536
4Sep 2, 2026 17:4170,602595,977,234584,925,0001,079,0002,113,536
5Sep 2, 2026 17:4170,701596,677,230585,688,0001,138,0002,113,536
6Sep 2, 2026 17:4170,735596,955,652586,057,0001,047,0002,113,536
7Sep 2, 2026 17:4170,949598,763,235587,834,0001,043,0002,113,536
8Sep 2, 2026 17:4170,991599,005,587588,166,0001,065,0002,113,536
9Sep 2, 2026 17:4171,007599,508,083588,287,0001,074,0002,113,536