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 18:29CheckHarryCheckHarryScore: 5,819Success
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 18:295,81359,314,89947,231,0001,022,0002,113,536
2Sep 2, 2026 18:295,81658,201,83847,111,0001,169,0002,113,536
3Sep 2, 2026 18:295,81658,131,68247,093,0001,182,0002,113,536
4Sep 2, 2026 18:295,81658,076,00747,101,0001,176,0002,113,536
5Sep 2, 2026 18:295,81958,191,60047,269,0001,034,0002,113,536
6Sep 2, 2026 18:295,82758,205,81447,326,0001,045,0002,113,536
7Sep 2, 2026 18:295,83658,322,15247,386,0001,054,0002,113,536
8Sep 2, 2026 18:295,84058,245,35747,376,0001,102,0002,113,536
9Sep 2, 2026 18:295,84258,348,27847,302,0001,190,0002,113,536