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 listFeb 24, 2026 21:55Mikołaj UzarskiMikołaj UzarskiScore: 5,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 21:555,10664,966,98440,359,0002,017,0002,506,752
2Feb 24, 2026 21:555,11068,159,32641,405,0001,009,0002,285,568
3Feb 24, 2026 21:555,11564,206,47840,433,0002,021,0002,285,568
4Feb 24, 2026 21:565,11570,062,99440,435,0002,021,0002,285,568
5Feb 24, 2026 21:555,11866,055,09941,472,0001,011,0002,506,752
6Feb 24, 2026 21:555,11867,472,94041,467,0001,011,0002,285,568
7Feb 24, 2026 21:555,12068,242,46340,471,0002,023,0002,502,656
8Feb 24, 2026 21:555,12265,153,65240,492,0002,024,0002,277,376
9Feb 24, 2026 21:565,12365,685,01041,506,0001,012,0002,285,568
10Feb 24, 2026 21:565,12473,381,13740,504,0002,025,0002,502,656
11Feb 24, 2026 21:565,13275,379,07841,581,0001,014,0002,502,656
12Feb 24, 2026 21:555,13477,048,14340,586,0002,029,0002,498,560
13Feb 24, 2026 21:565,13575,502,49041,606,0001,014,0002,506,752
14Feb 24, 2026 21:565,15867,746,54340,818,0001,991,0002,285,568
15Feb 24, 2026 21:555,99278,862,30746,688,0003,044,0002,514,944