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 listFeb 6, 2025 13:52mebowlermebowlerScore: 124,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 13:52124,6211,056,818,9071,032,353,0001,998,0002,285,568
2Feb 6, 2025 13:52124,6391,058,046,2321,030,502,0004,001,0002,285,568
3Feb 6, 2025 13:52124,7021,060,329,8601,029,031,0005,994,0002,498,560