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 2, 2026 16:59CheckHarryCheckHarryScore: 6,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 16:596,50963,813,19652,989,0001,037,0002,113,536
2Sep 2, 2026 16:596,52663,993,75653,138,0001,036,0002,113,536
3Sep 2, 2026 16:596,54564,266,67653,281,0001,043,0002,113,536
4Sep 2, 2026 16:596,57164,505,69153,505,0001,036,0002,113,536
5Sep 2, 2026 16:596,57964,427,83053,572,0001,040,0002,113,536
6Sep 2, 2026 16:596,58264,485,55853,589,0001,047,0002,113,536
7Sep 2, 2026 16:596,58564,537,24553,603,0001,054,0002,113,536
8Sep 2, 2026 16:596,60964,674,11953,814,0001,041,0002,113,536
9Sep 2, 2026 16:596,79866,238,68155,263,0001,165,0002,113,536