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 6, 2026 02:36CheckHarryCheckHarryScore: 4,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 02:384,19744,715,46533,820,0001,019,0002,113,536
2Sep 6, 2026 02:384,20244,738,97333,869,0001,010,0002,113,536
3Sep 6, 2026 02:384,21044,845,74733,938,0001,008,0002,113,536
4Sep 6, 2026 02:384,21244,907,78333,958,0001,008,0002,113,536
5Sep 6, 2026 02:384,21944,882,34734,001,0001,021,0002,113,536
6Sep 6, 2026 02:384,22444,990,64134,060,0001,007,0002,113,536
7Sep 6, 2026 02:384,23345,016,70734,134,0001,008,0002,113,536
8Sep 6, 2026 02:384,35446,154,43035,108,0001,034,0002,113,536
9Sep 6, 2026 02:384,43146,669,56635,755,0001,025,0002,113,536