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 24, 2024 11:42Sean DewarSean DewarScore: 69,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 11:4269,371604,693,763574,784,000999,0002,289,664
2Dec 24, 2024 11:4269,371606,437,929573,783,0001,999,0002,289,664
3Dec 24, 2024 11:4269,378607,983,193573,840,0001,999,0002,281,472
4Dec 24, 2024 11:4269,383605,883,547574,884,000999,0002,289,664
5Dec 24, 2024 11:4269,388602,761,738573,923,0001,999,0002,289,664
6Dec 24, 2024 11:4269,479601,669,515574,674,0001,998,0002,289,664
7Dec 24, 2024 11:4269,524600,666,062575,052,0002,000,0002,289,664
8Dec 24, 2024 11:4269,573609,898,212576,458,000999,0002,281,472
9Dec 24, 2024 11:4269,681609,826,167577,353,0001,000,0002,273,280