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 07:19CheckHarryCheckHarryScore: 4,833Success
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 07:204,73649,157,26338,282,0001,027,0002,113,536
2Sep 3, 2026 07:204,73850,332,82237,326,0002,006,0002,113,536
3Sep 3, 2026 07:204,81349,769,77738,926,0001,025,0002,113,536
4Sep 3, 2026 07:204,83050,626,82838,089,0002,003,0002,113,536
5Sep 3, 2026 07:204,83349,984,01038,105,0002,015,0002,113,536
6Sep 3, 2026 07:204,87350,294,20538,431,0002,016,0002,113,536
7Sep 3, 2026 07:204,89950,554,05939,642,0001,025,0002,113,536
8Sep 3, 2026 07:204,89950,567,49238,661,0002,007,0002,113,536
9Sep 3, 2026 07:204,90850,623,75639,718,0001,025,0002,113,536