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 listApr 23, 2025 18:46Alona MalohAlona MalohScore: 1,990,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 18:461,987,68316,535,811,94016,408,815,00088,955,0002,277,376
2Apr 23, 2025 18:461,988,90716,538,492,03216,440,961,00066,971,0002,277,376
3Apr 23, 2025 18:461,989,96316,556,032,35516,445,728,00070,968,0002,277,376
4Apr 23, 2025 18:461,990,08316,551,818,11016,447,722,00069,969,0002,277,376
5Apr 23, 2025 18:461,990,47616,552,236,55716,441,989,00078,961,0002,277,376
6Apr 23, 2025 18:461,991,58016,562,512,54016,472,138,00057,975,0002,277,376
7Apr 23, 2025 18:461,993,66016,573,292,07316,476,411,00070,971,0002,277,376
8Apr 23, 2025 18:461,997,66416,613,215,78516,511,640,00068,973,0002,289,664
9Apr 23, 2025 18:462,184,47618,168,169,49818,068,183,00062,969,0002,371,584