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 26, 2024 22:18Joad NacerJoad NacerScore: 5,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2024 22:185,18267,600,57942,013,0001,000,0002,535,424
2Dec 26, 2024 22:185,22161,065,22341,317,0002,015,0002,301,952
3Dec 26, 2024 22:185,23364,018,27442,428,0001,010,0002,306,048
4Dec 26, 2024 22:185,33366,263,28343,262,0001,006,0002,531,328
5Dec 26, 2024 22:185,70067,529,37045,298,0002,013,0002,297,856
6Dec 26, 2024 22:185,92770,742,20948,190,0001,003,0002,289,664