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 listDec 6, 2025 11:06Rajarshi BasuRajarshi BasuScore: 6,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 11:066,79879,887,78355,415,0001,007,0002,527,232
2Dec 6, 2025 11:066,79880,252,13654,412,0002,015,0002,273,280
3Dec 6, 2025 11:066,80081,590,39654,421,0002,015,0002,289,664
4Dec 6, 2025 11:066,80681,302,86055,482,0001,008,0002,289,664
5Dec 6, 2025 11:066,81381,018,31955,541,0001,009,0002,289,664
6Dec 6, 2025 11:066,81882,816,57155,578,0001,010,0002,273,280
7Dec 6, 2025 11:066,96786,308,26156,827,000996,0002,289,664
8Dec 6, 2025 11:066,96986,859,02855,845,0001,994,0002,289,664
9Dec 6, 2025 11:066,97585,287,36855,899,0001,996,0002,269,184
10Dec 6, 2025 11:066,97586,042,03254,898,0002,994,0002,289,664
11Dec 6, 2025 11:066,98289,592,95055,952,0001,998,0002,289,664
12Dec 6, 2025 11:066,98383,628,11355,957,0001,998,0002,289,664