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 24, 2026 20:26Victor MerckléVictor MerckléScore: 3,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:273,74640,824,21829,972,0001,123,0002,117,632stderr
2Aug 24, 2026 20:273,75339,568,37030,013,0001,143,0002,117,632stderr
3Aug 24, 2026 20:273,76639,624,24430,137,0001,125,0002,117,632stderr
4Aug 24, 2026 20:273,78239,800,05030,266,0001,125,0002,117,632stderr
5Aug 24, 2026 20:273,78539,793,46230,263,0001,156,0002,117,632stderr
6Aug 24, 2026 20:273,78939,790,09630,377,0001,078,0002,117,632stderr
7Aug 24, 2026 20:273,84740,320,87130,812,0001,123,0002,117,632stderr
8Aug 24, 2026 20:273,89640,810,94531,278,0001,065,0002,117,632stderr
9Aug 24, 2026 20:273,98641,482,91032,015,0001,070,0002,117,632stderr