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 02:44CheckHarryCheckHarryScore: 6,342Success
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 02:456,32162,291,30151,427,0001,044,0002,113,536
2Sep 3, 2026 02:456,33062,330,23551,489,0001,052,0002,113,536
3Sep 3, 2026 02:456,33262,416,11851,515,0001,048,0002,113,536
4Sep 3, 2026 02:456,33663,541,98751,422,0001,175,0002,113,536
5Sep 3, 2026 02:456,34262,469,29551,603,0001,036,0002,113,536
6Sep 3, 2026 02:456,34262,391,94751,486,0001,156,0002,113,536
7Sep 3, 2026 02:456,35662,753,06351,712,0001,045,0002,113,536
8Sep 3, 2026 02:456,36762,617,04051,675,0001,175,0002,113,536
9Sep 3, 2026 02:456,38963,011,73951,963,0001,069,0002,113,536