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 01:14CheckHarryCheckHarryScore: 5,978Success
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 01:155,97259,378,89048,533,0001,038,0002,113,536
2Sep 3, 2026 01:155,97459,408,77448,522,0001,063,0002,113,536
3Sep 3, 2026 01:155,97459,452,41348,523,0001,063,0002,113,536
4Sep 3, 2026 01:155,97759,412,76748,555,0001,057,0002,113,536
5Sep 3, 2026 01:155,97859,470,89248,583,0001,039,0002,113,536
6Sep 3, 2026 01:155,98159,521,91448,597,0001,053,0002,113,536
7Sep 3, 2026 01:155,98160,283,10048,591,0001,055,0002,113,536
8Sep 3, 2026 01:155,98259,440,49348,615,0001,041,0002,113,536
9Sep 3, 2026 01:155,98459,574,57348,612,0001,058,0002,113,536