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 listAug 1, 2026 19:17George SeabridgeGeorge SeabridgeScore: 8,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 19:178,60081,371,91570,299,0001,085,0002,113,536
2Aug 1, 2026 19:178,60181,419,33470,315,0001,076,0002,113,536
3Aug 1, 2026 19:178,60281,437,63270,318,0001,085,0002,113,536
4Aug 1, 2026 19:178,60281,451,70270,317,0001,082,0002,113,536
5Aug 1, 2026 19:178,61381,447,93070,478,0001,012,0002,113,536
6Aug 1, 2026 19:178,63881,776,62170,454,0001,249,0002,113,536
7Aug 1, 2026 19:179,32189,016,77776,266,0001,104,0002,113,536
8Aug 1, 2026 19:179,69391,326,25479,311,0001,143,0002,113,536
9Aug 1, 2026 19:179,72392,125,43779,606,0001,101,0002,113,536