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 07:22Ashish AhujaAshish AhujaScore: 11,262Success
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 07:2211,037116,050,19584,638,0006,970,0002,277,376
2Aug 18, 2025 07:2211,087113,788,57486,017,0006,001,0002,412,544
3Aug 18, 2025 07:2211,132121,852,26386,370,0006,025,0002,535,424
4Aug 18, 2025 07:2211,147119,082,63285,553,0006,963,0002,535,424
5Aug 18, 2025 07:2211,170118,391,70286,732,0005,981,0002,457,600
6Aug 18, 2025 07:2211,187117,260,85787,859,0004,991,0002,277,376
7Aug 18, 2025 07:2211,262115,722,01585,517,0007,955,0002,392,064
8Aug 18, 2025 07:2211,266119,409,69888,535,0004,973,0002,363,392
9Aug 18, 2025 07:2211,268121,177,89786,561,0006,964,0002,482,176
10Aug 18, 2025 07:2211,358117,197,09687,248,0007,020,0002,387,968
11Aug 18, 2025 07:2211,386119,460,81687,544,0006,963,0002,281,472
12Aug 18, 2025 07:2212,179130,130,27395,084,0006,005,0002,531,328