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 15:55Rajarshi BasuRajarshi BasuScore: 6,345Success
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 15:556,20876,239,27450,515,0001,010,0002,396,160
2Dec 6, 2025 15:556,21172,349,06149,527,0002,021,0002,273,280
3Dec 6, 2025 15:556,21582,158,09150,575,0001,011,0002,289,664
4Dec 6, 2025 15:566,21776,444,44150,591,0001,011,0002,277,376
5Dec 6, 2025 15:566,22078,259,06550,618,0001,012,0002,289,664
6Dec 6, 2025 15:566,25977,657,50850,949,000999,0002,281,472
7Dec 6, 2025 15:556,34582,631,70751,652,0001,012,0002,289,664
8Dec 6, 2025 15:566,36385,776,24350,822,0001,993,0002,277,376
9Dec 6, 2025 15:566,36776,132,27050,849,0001,994,0002,269,184
10Dec 6, 2025 15:556,36780,256,72050,848,0001,994,0002,273,280
11Dec 6, 2025 15:566,38278,047,80350,973,0001,998,0002,289,664
12Dec 6, 2025 15:556,40677,214,66152,170,0001,003,0002,269,184