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 06:25CheckHarryCheckHarryScore: 8,026Success
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 06:267,95875,955,76165,043,0001,015,0002,113,536
2Sep 3, 2026 06:267,97976,101,78665,212,0001,015,0002,113,536
3Sep 3, 2026 06:267,99176,170,03964,323,0002,008,0002,113,536
4Sep 3, 2026 06:268,00776,307,48365,444,0001,015,0002,113,536
5Sep 3, 2026 06:268,02676,521,71664,597,0002,026,0002,113,536
6Sep 3, 2026 06:268,07576,893,39166,011,0001,015,0002,113,536
7Sep 3, 2026 06:268,08376,961,35566,076,0001,015,0002,113,536
8Sep 3, 2026 06:268,11477,254,29365,349,0002,002,0002,113,536
9Sep 3, 2026 06:268,15977,920,56366,705,0001,015,0002,113,536