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 18, 2025 05:58Ashish AhujaAshish AhujaScore: 11,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 05:5811,786126,468,32190,834,0006,987,0002,347,008
2Aug 18, 2025 05:5811,790126,162,24087,874,0009,985,0002,351,104
3Aug 18, 2025 05:5811,841124,433,09790,261,0008,023,0002,351,104
4Aug 18, 2025 05:5811,880123,107,68689,637,0008,963,0002,392,064
5Aug 18, 2025 05:5811,893125,588,13292,730,0005,982,0002,347,008
6Aug 18, 2025 05:5811,898129,109,25790,772,0007,979,0002,338,816
7Aug 18, 2025 05:5811,936126,614,20792,064,0007,004,0002,338,816
8Aug 18, 2025 05:5811,938121,898,65091,080,0008,007,0002,351,104
9Aug 18, 2025 05:5811,991128,207,37289,574,0009,952,0002,502,656
10Aug 18, 2025 05:5812,193128,220,90194,192,0007,014,0002,461,696
11Aug 18, 2025 05:5812,289124,922,54395,997,0005,999,0002,424,832
12Aug 18, 2025 05:5812,326129,891,47797,291,0005,015,0002,482,176