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 14:28CheckHarryCheckHarryScore: 4,372Success
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 14:284,28045,401,02334,514,0001,018,0002,113,536
2Sep 3, 2026 14:284,29545,589,17134,640,0001,016,0002,113,536
3Sep 3, 2026 14:284,33245,872,33834,926,0001,036,0002,113,536
4Sep 3, 2026 14:284,34345,951,22735,031,0001,016,0002,113,536
5Sep 3, 2026 14:284,37246,220,28135,274,0001,017,0002,113,536
6Sep 3, 2026 14:284,45446,808,55335,952,0001,018,0002,113,536
7Sep 3, 2026 14:284,48147,109,45636,172,0001,025,0002,113,536
8Sep 3, 2026 14:284,50947,276,98136,417,0001,015,0002,113,536
9Sep 3, 2026 14:284,52847,343,17336,571,0001,017,0002,113,536